./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:44:54,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:44:54,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:44:54,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:44:54,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:44:54,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:44:54,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:44:54,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:44:54,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:44:54,560 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:44:54,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:44:54,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:44:54,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:44:54,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:44:54,562 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:44:54,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:44:54,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:44:54,563 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:44:54,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:44:54,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:44:54,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:44:54,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:44:54,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:44:54,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:44:54,565 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:44:54,566 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:44:54,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:44:54,566 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:44:54,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:44:54,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:44:54,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:44:54,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:44:54,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:44:54,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:44:54,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:44:54,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:44:54,569 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:44:54,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:44:54,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:44:54,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:44:54,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:44:54,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:44:54,571 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 [2024-10-24 11:44:54,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:44:54,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:44:54,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:44:54,882 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:44:54,883 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:44:54,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i [2024-10-24 11:44:56,428 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:44:56,599 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:44:56,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i [2024-10-24 11:44:56,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb9adc68c/c50bfa03d26947da87b216faf3dc9a9a/FLAG337f678df [2024-10-24 11:44:56,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb9adc68c/c50bfa03d26947da87b216faf3dc9a9a [2024-10-24 11:44:56,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:44:56,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:44:56,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:44:56,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:44:56,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:44:56,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:44:56" (1/1) ... [2024-10-24 11:44:56,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7069ba75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:56, skipping insertion in model container [2024-10-24 11:44:56,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:44:56" (1/1) ... [2024-10-24 11:44:56,664 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:44:56,815 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i[916,929] [2024-10-24 11:44:56,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:44:56,873 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:44:56,883 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i[916,929] [2024-10-24 11:44:56,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:44:56,937 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:44:56,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:56 WrapperNode [2024-10-24 11:44:56,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:44:56,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:44:56,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:44:56,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:44:56,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:56" (1/1) ... [2024-10-24 11:44:56,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:56" (1/1) ... [2024-10-24 11:44:57,017 INFO L138 Inliner]: procedures = 29, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 467 [2024-10-24 11:44:57,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:44:57,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:44:57,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:44:57,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:44:57,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:56" (1/1) ... [2024-10-24 11:44:57,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:56" (1/1) ... [2024-10-24 11:44:57,037 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:56" (1/1) ... [2024-10-24 11:44:57,061 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 13]. The 15 writes are split as follows [0, 15]. [2024-10-24 11:44:57,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:56" (1/1) ... [2024-10-24 11:44:57,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:56" (1/1) ... [2024-10-24 11:44:57,080 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:56" (1/1) ... [2024-10-24 11:44:57,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:56" (1/1) ... [2024-10-24 11:44:57,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:56" (1/1) ... [2024-10-24 11:44:57,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:56" (1/1) ... [2024-10-24 11:44:57,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:44:57,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:44:57,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:44:57,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:44:57,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:56" (1/1) ... [2024-10-24 11:44:57,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:44:57,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:44:57,140 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:44:57,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:44:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:44:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:44:57,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:44:57,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:44:57,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:44:57,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:44:57,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:44:57,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:44:57,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:44:57,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:44:57,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:44:57,199 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:44:57,199 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:44:57,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:44:57,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:44:57,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:44:57,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:44:57,318 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:44:57,320 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:44:57,893 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-10-24 11:44:57,893 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:44:57,922 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:44:57,923 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:44:57,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:44:57 BoogieIcfgContainer [2024-10-24 11:44:57,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:44:57,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:44:57,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:44:57,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:44:57,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:44:56" (1/3) ... [2024-10-24 11:44:57,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651fcfae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:44:57, skipping insertion in model container [2024-10-24 11:44:57,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:56" (2/3) ... [2024-10-24 11:44:57,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651fcfae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:44:57, skipping insertion in model container [2024-10-24 11:44:57,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:44:57" (3/3) ... [2024-10-24 11:44:57,935 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-13.i [2024-10-24 11:44:57,950 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:44:57,950 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:44:58,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:44:58,027 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@682b027f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:44:58,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:44:58,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:44:58,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 11:44:58,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:58,043 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:44:58,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:58,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:58,049 INFO L85 PathProgramCache]: Analyzing trace with hash -342532188, now seen corresponding path program 1 times [2024-10-24 11:44:58,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:44:58,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551172169] [2024-10-24 11:44:58,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:58,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:44:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:58,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:44:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:58,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:44:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:58,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:44:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:58,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:44:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:58,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:44:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:58,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:44:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:58,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:44:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:58,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:44:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:58,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:44:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:58,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:44:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:58,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:44:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:58,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:44:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:58,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:44:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:58,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:44:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:58,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:44:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:44:58,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:44:58,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551172169] [2024-10-24 11:44:58,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551172169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:44:58,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:44:58,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:44:58,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417795836] [2024-10-24 11:44:58,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:58,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:44:58,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:44:58,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:44:58,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:44:58,478 INFO L87 Difference]: Start difference. First operand has 105 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:44:58,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:58,521 INFO L93 Difference]: Finished difference Result 207 states and 331 transitions. [2024-10-24 11:44:58,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:44:58,524 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2024-10-24 11:44:58,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:58,534 INFO L225 Difference]: With dead ends: 207 [2024-10-24 11:44:58,534 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 11:44:58,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:44:58,544 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:58,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:44:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 11:44:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-24 11:44:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:44:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 154 transitions. [2024-10-24 11:44:58,587 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 154 transitions. Word has length 126 [2024-10-24 11:44:58,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:58,588 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 154 transitions. [2024-10-24 11:44:58,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:44:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 154 transitions. [2024-10-24 11:44:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 11:44:58,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:58,591 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:44:58,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:44:58,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:58,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash 219295054, now seen corresponding path program 1 times [2024-10-24 11:44:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:44:58,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264396299] [2024-10-24 11:44:58,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:44:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:59,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:44:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:59,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:44:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:59,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:44:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:59,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:44:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:59,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:44:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:59,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:44:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:59,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:44:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:59,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:44:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:59,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:44:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:59,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:44:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:59,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:44:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:59,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:44:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:59,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:44:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:59,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:44:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:59,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:44:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:59,100 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:44:59,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:44:59,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264396299] [2024-10-24 11:44:59,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264396299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:44:59,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:44:59,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:44:59,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157261322] [2024-10-24 11:44:59,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:59,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:44:59,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:44:59,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:44:59,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:44:59,104 INFO L87 Difference]: Start difference. First operand 103 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:44:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:59,172 INFO L93 Difference]: Finished difference Result 207 states and 310 transitions. [2024-10-24 11:44:59,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:44:59,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-10-24 11:44:59,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:59,177 INFO L225 Difference]: With dead ends: 207 [2024-10-24 11:44:59,179 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 11:44:59,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:44:59,182 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:59,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 437 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:44:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 11:44:59,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-24 11:44:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:44:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 156 transitions. [2024-10-24 11:44:59,198 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 156 transitions. Word has length 126 [2024-10-24 11:44:59,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:59,200 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 156 transitions. [2024-10-24 11:44:59,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:44:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 156 transitions. [2024-10-24 11:44:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 11:44:59,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:59,204 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:44:59,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:44:59,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:59,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:59,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1326947827, now seen corresponding path program 1 times [2024-10-24 11:44:59,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:44:59,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86294977] [2024-10-24 11:44:59,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:59,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:44:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:00,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:00,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:00,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:00,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:00,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:00,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:00,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:00,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:00,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:00,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:00,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:00,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:00,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:00,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:00,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:00,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:00,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86294977] [2024-10-24 11:45:00,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86294977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:00,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:00,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:45:00,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895217350] [2024-10-24 11:45:00,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:00,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:45:00,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:00,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:45:00,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:45:00,388 INFO L87 Difference]: Start difference. First operand 105 states and 156 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:00,710 INFO L93 Difference]: Finished difference Result 313 states and 466 transitions. [2024-10-24 11:45:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:45:00,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-10-24 11:45:00,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:00,714 INFO L225 Difference]: With dead ends: 313 [2024-10-24 11:45:00,714 INFO L226 Difference]: Without dead ends: 209 [2024-10-24 11:45:00,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:45:00,721 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 100 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:00,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 251 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:45:00,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-24 11:45:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2024-10-24 11:45:00,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 172 states have (on average 1.430232558139535) internal successors, (246), 172 states have internal predecessors, (246), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:45:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 306 transitions. [2024-10-24 11:45:00,766 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 306 transitions. Word has length 128 [2024-10-24 11:45:00,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:00,768 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 306 transitions. [2024-10-24 11:45:00,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:00,769 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 306 transitions. [2024-10-24 11:45:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 11:45:00,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:00,774 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:00,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:45:00,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:00,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:00,775 INFO L85 PathProgramCache]: Analyzing trace with hash -361995915, now seen corresponding path program 1 times [2024-10-24 11:45:00,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:00,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918245769] [2024-10-24 11:45:00,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:00,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:01,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:01,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:01,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:01,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:01,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:01,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:01,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:01,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:01,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:01,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:01,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:01,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:01,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:01,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:01,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:01,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:01,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918245769] [2024-10-24 11:45:01,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918245769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:01,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:01,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:45:01,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324778987] [2024-10-24 11:45:01,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:01,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:45:01,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:01,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:45:01,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:45:01,141 INFO L87 Difference]: Start difference. First operand 205 states and 306 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:01,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:01,292 INFO L93 Difference]: Finished difference Result 411 states and 613 transitions. [2024-10-24 11:45:01,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:45:01,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-10-24 11:45:01,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:01,296 INFO L225 Difference]: With dead ends: 411 [2024-10-24 11:45:01,297 INFO L226 Difference]: Without dead ends: 207 [2024-10-24 11:45:01,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:45:01,301 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 4 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:01,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 360 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:45:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-24 11:45:01,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2024-10-24 11:45:01,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 172 states have (on average 1.4186046511627908) internal successors, (244), 172 states have internal predecessors, (244), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:45:01,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 304 transitions. [2024-10-24 11:45:01,325 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 304 transitions. Word has length 128 [2024-10-24 11:45:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:01,328 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 304 transitions. [2024-10-24 11:45:01,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 304 transitions. [2024-10-24 11:45:01,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 11:45:01,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:01,330 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:01,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:45:01,330 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:01,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:01,331 INFO L85 PathProgramCache]: Analyzing trace with hash 339068663, now seen corresponding path program 1 times [2024-10-24 11:45:01,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:01,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542230552] [2024-10-24 11:45:01,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:01,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:02,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:02,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:02,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:02,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:02,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:02,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:02,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:02,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:02,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:02,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:02,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:02,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:02,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:02,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:02,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:02,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:02,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542230552] [2024-10-24 11:45:02,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542230552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:02,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:02,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:45:02,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622110315] [2024-10-24 11:45:02,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:02,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:45:02,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:02,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:45:02,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:45:02,702 INFO L87 Difference]: Start difference. First operand 205 states and 304 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:45:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:02,957 INFO L93 Difference]: Finished difference Result 454 states and 672 transitions. [2024-10-24 11:45:02,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:45:02,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2024-10-24 11:45:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:02,962 INFO L225 Difference]: With dead ends: 454 [2024-10-24 11:45:02,962 INFO L226 Difference]: Without dead ends: 250 [2024-10-24 11:45:02,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:45:02,963 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 108 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:02,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 392 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:45:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-24 11:45:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 210. [2024-10-24 11:45:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 177 states have (on average 1.4124293785310735) internal successors, (250), 177 states have internal predecessors, (250), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:45:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 310 transitions. [2024-10-24 11:45:02,977 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 310 transitions. Word has length 128 [2024-10-24 11:45:02,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:02,977 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 310 transitions. [2024-10-24 11:45:02,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:45:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 310 transitions. [2024-10-24 11:45:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 11:45:02,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:02,979 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:02,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:45:02,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:02,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:02,985 INFO L85 PathProgramCache]: Analyzing trace with hash -681999691, now seen corresponding path program 1 times [2024-10-24 11:45:02,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:02,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27691229] [2024-10-24 11:45:02,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:02,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,299 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:03,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:03,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27691229] [2024-10-24 11:45:03,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27691229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:03,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:03,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:45:03,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217452842] [2024-10-24 11:45:03,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:03,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:45:03,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:03,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:45:03,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:45:03,302 INFO L87 Difference]: Start difference. First operand 210 states and 310 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:03,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:03,533 INFO L93 Difference]: Finished difference Result 449 states and 663 transitions. [2024-10-24 11:45:03,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:45:03,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-10-24 11:45:03,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:03,538 INFO L225 Difference]: With dead ends: 449 [2024-10-24 11:45:03,538 INFO L226 Difference]: Without dead ends: 240 [2024-10-24 11:45:03,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:45:03,539 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 46 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:03,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 409 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:45:03,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-24 11:45:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 212. [2024-10-24 11:45:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 179 states have (on average 1.4134078212290502) internal successors, (253), 179 states have internal predecessors, (253), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:45:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 313 transitions. [2024-10-24 11:45:03,550 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 313 transitions. Word has length 128 [2024-10-24 11:45:03,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:03,550 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 313 transitions. [2024-10-24 11:45:03,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 313 transitions. [2024-10-24 11:45:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:45:03,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:03,552 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:03,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:45:03,552 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:03,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:03,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1138983093, now seen corresponding path program 1 times [2024-10-24 11:45:03,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:03,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518197930] [2024-10-24 11:45:03,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:03,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:03,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:03,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518197930] [2024-10-24 11:45:03,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518197930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:03,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:03,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:45:03,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145065975] [2024-10-24 11:45:03,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:03,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:45:03,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:03,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:45:03,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:45:03,873 INFO L87 Difference]: Start difference. First operand 212 states and 313 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:04,130 INFO L93 Difference]: Finished difference Result 541 states and 790 transitions. [2024-10-24 11:45:04,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:45:04,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-10-24 11:45:04,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:04,135 INFO L225 Difference]: With dead ends: 541 [2024-10-24 11:45:04,135 INFO L226 Difference]: Without dead ends: 330 [2024-10-24 11:45:04,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:45:04,137 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 64 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:04,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 607 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:45:04,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-24 11:45:04,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 326. [2024-10-24 11:45:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 281 states have (on average 1.398576512455516) internal successors, (393), 283 states have internal predecessors, (393), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:45:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 473 transitions. [2024-10-24 11:45:04,161 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 473 transitions. Word has length 129 [2024-10-24 11:45:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:04,162 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 473 transitions. [2024-10-24 11:45:04,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:04,162 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 473 transitions. [2024-10-24 11:45:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:45:04,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:04,164 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:04,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:45:04,164 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:04,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:04,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1819041463, now seen corresponding path program 1 times [2024-10-24 11:45:04,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:04,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586049988] [2024-10-24 11:45:04,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:04,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:04,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:04,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586049988] [2024-10-24 11:45:04,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586049988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:04,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:04,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:45:04,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095447682] [2024-10-24 11:45:04,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:04,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:45:04,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:04,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:45:04,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:45:04,276 INFO L87 Difference]: Start difference. First operand 326 states and 473 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:04,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:04,307 INFO L93 Difference]: Finished difference Result 655 states and 953 transitions. [2024-10-24 11:45:04,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:45:04,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-10-24 11:45:04,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:04,316 INFO L225 Difference]: With dead ends: 655 [2024-10-24 11:45:04,316 INFO L226 Difference]: Without dead ends: 330 [2024-10-24 11:45:04,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:45:04,317 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:04,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:45:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-24 11:45:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2024-10-24 11:45:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 285 states have (on average 1.3929824561403508) internal successors, (397), 287 states have internal predecessors, (397), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:45:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 477 transitions. [2024-10-24 11:45:04,332 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 477 transitions. Word has length 129 [2024-10-24 11:45:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:04,333 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 477 transitions. [2024-10-24 11:45:04,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 477 transitions. [2024-10-24 11:45:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:45:04,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:04,334 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:04,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:45:04,335 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:04,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:04,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1426014453, now seen corresponding path program 1 times [2024-10-24 11:45:04,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:04,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496986728] [2024-10-24 11:45:04,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:04,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:05,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:05,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:05,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:05,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:05,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:05,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:05,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:05,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:05,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:05,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:05,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:05,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:05,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:05,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:05,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:05,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:05,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496986728] [2024-10-24 11:45:05,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496986728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:05,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:05,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:45:05,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649712487] [2024-10-24 11:45:05,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:05,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:45:05,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:05,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:45:05,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:45:05,800 INFO L87 Difference]: Start difference. First operand 330 states and 477 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:45:06,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:06,532 INFO L93 Difference]: Finished difference Result 1053 states and 1516 transitions. [2024-10-24 11:45:06,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:45:06,533 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-24 11:45:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:06,537 INFO L225 Difference]: With dead ends: 1053 [2024-10-24 11:45:06,537 INFO L226 Difference]: Without dead ends: 724 [2024-10-24 11:45:06,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:45:06,538 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 244 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:06,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 759 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:45:06,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-10-24 11:45:06,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 715. [2024-10-24 11:45:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 622 states have (on average 1.3938906752411575) internal successors, (867), 627 states have internal predecessors, (867), 82 states have call successors, (82), 10 states have call predecessors, (82), 10 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-24 11:45:06,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1031 transitions. [2024-10-24 11:45:06,573 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1031 transitions. Word has length 129 [2024-10-24 11:45:06,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:06,574 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1031 transitions. [2024-10-24 11:45:06,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:45:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1031 transitions. [2024-10-24 11:45:06,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:45:06,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:06,576 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:06,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:45:06,576 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:06,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:06,577 INFO L85 PathProgramCache]: Analyzing trace with hash -549960649, now seen corresponding path program 1 times [2024-10-24 11:45:06,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:06,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758918350] [2024-10-24 11:45:06,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:06,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:07,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:07,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:07,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:07,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:07,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:07,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:07,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:07,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:07,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:07,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:07,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:07,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:07,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:07,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:07,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:07,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:07,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758918350] [2024-10-24 11:45:07,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758918350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:07,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:07,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:45:07,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189224462] [2024-10-24 11:45:07,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:07,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:45:07,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:07,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:45:07,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:45:07,230 INFO L87 Difference]: Start difference. First operand 715 states and 1031 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:07,452 INFO L93 Difference]: Finished difference Result 1432 states and 2065 transitions. [2024-10-24 11:45:07,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:45:07,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-10-24 11:45:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:07,456 INFO L225 Difference]: With dead ends: 1432 [2024-10-24 11:45:07,457 INFO L226 Difference]: Without dead ends: 718 [2024-10-24 11:45:07,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:45:07,459 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 84 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:07,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 255 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:45:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-10-24 11:45:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 712. [2024-10-24 11:45:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 619 states have (on average 1.3893376413570275) internal successors, (860), 624 states have internal predecessors, (860), 82 states have call successors, (82), 10 states have call predecessors, (82), 10 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-24 11:45:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1024 transitions. [2024-10-24 11:45:07,489 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1024 transitions. Word has length 129 [2024-10-24 11:45:07,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:07,490 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 1024 transitions. [2024-10-24 11:45:07,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1024 transitions. [2024-10-24 11:45:07,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:45:07,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:07,492 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:07,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:45:07,492 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:07,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:07,492 INFO L85 PathProgramCache]: Analyzing trace with hash -942987659, now seen corresponding path program 1 times [2024-10-24 11:45:07,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:07,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4683522] [2024-10-24 11:45:07,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:07,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:08,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:08,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:08,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:08,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:08,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:08,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:08,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:08,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:08,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:08,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:08,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:08,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:08,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:08,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:08,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:08,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:08,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4683522] [2024-10-24 11:45:08,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4683522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:08,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:08,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:45:08,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715406697] [2024-10-24 11:45:08,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:08,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:45:08,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:08,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:45:08,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:45:08,709 INFO L87 Difference]: Start difference. First operand 712 states and 1024 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:45:09,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:09,608 INFO L93 Difference]: Finished difference Result 1121 states and 1596 transitions. [2024-10-24 11:45:09,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:45:09,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-24 11:45:09,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:09,614 INFO L225 Difference]: With dead ends: 1121 [2024-10-24 11:45:09,614 INFO L226 Difference]: Without dead ends: 735 [2024-10-24 11:45:09,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:45:09,616 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 315 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:09,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 754 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:45:09,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-10-24 11:45:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 728. [2024-10-24 11:45:09,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 630 states have (on average 1.3793650793650793) internal successors, (869), 636 states have internal predecessors, (869), 84 states have call successors, (84), 13 states have call predecessors, (84), 13 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-24 11:45:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1037 transitions. [2024-10-24 11:45:09,654 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1037 transitions. Word has length 129 [2024-10-24 11:45:09,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:09,655 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1037 transitions. [2024-10-24 11:45:09,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:45:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1037 transitions. [2024-10-24 11:45:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:45:09,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:09,657 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:09,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:45:09,657 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:09,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:09,657 INFO L85 PathProgramCache]: Analyzing trace with hash -262929289, now seen corresponding path program 1 times [2024-10-24 11:45:09,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:09,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502853567] [2024-10-24 11:45:09,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:09,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:09,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:09,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:09,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:09,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:09,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:09,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:09,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:09,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:09,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:09,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:09,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:09,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:09,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:09,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:09,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:09,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:09,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502853567] [2024-10-24 11:45:09,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502853567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:09,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:09,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:45:09,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709628137] [2024-10-24 11:45:09,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:09,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:45:09,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:09,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:45:09,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:45:09,861 INFO L87 Difference]: Start difference. First operand 728 states and 1037 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:10,204 INFO L93 Difference]: Finished difference Result 1684 states and 2416 transitions. [2024-10-24 11:45:10,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:45:10,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-10-24 11:45:10,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:10,211 INFO L225 Difference]: With dead ends: 1684 [2024-10-24 11:45:10,212 INFO L226 Difference]: Without dead ends: 965 [2024-10-24 11:45:10,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:45:10,214 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 131 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:10,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 984 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:45:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-10-24 11:45:10,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 919. [2024-10-24 11:45:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 774 states have (on average 1.3695090439276485) internal successors, (1060), 780 states have internal predecessors, (1060), 127 states have call successors, (127), 17 states have call predecessors, (127), 17 states have return successors, (127), 121 states have call predecessors, (127), 127 states have call successors, (127) [2024-10-24 11:45:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1314 transitions. [2024-10-24 11:45:10,265 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1314 transitions. Word has length 129 [2024-10-24 11:45:10,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:10,266 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1314 transitions. [2024-10-24 11:45:10,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1314 transitions. [2024-10-24 11:45:10,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:45:10,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:10,268 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:10,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:45:10,268 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:10,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:10,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1292000947, now seen corresponding path program 1 times [2024-10-24 11:45:10,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:10,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790030089] [2024-10-24 11:45:10,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:10,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:11,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:11,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:11,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:11,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:11,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:11,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:11,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:11,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:11,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:11,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:11,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:11,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:11,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:11,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:11,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:11,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:11,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790030089] [2024-10-24 11:45:11,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790030089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:11,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:11,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:45:11,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752935338] [2024-10-24 11:45:11,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:11,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:45:11,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:11,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:45:11,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:45:11,506 INFO L87 Difference]: Start difference. First operand 919 states and 1314 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:45:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:12,298 INFO L93 Difference]: Finished difference Result 1891 states and 2698 transitions. [2024-10-24 11:45:12,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:45:12,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-24 11:45:12,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:12,304 INFO L225 Difference]: With dead ends: 1891 [2024-10-24 11:45:12,304 INFO L226 Difference]: Without dead ends: 987 [2024-10-24 11:45:12,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:45:12,307 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 237 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:12,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 612 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:45:12,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-10-24 11:45:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 978. [2024-10-24 11:45:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 829 states have (on average 1.3703256936067552) internal successors, (1136), 836 states have internal predecessors, (1136), 129 states have call successors, (129), 19 states have call predecessors, (129), 19 states have return successors, (129), 122 states have call predecessors, (129), 129 states have call successors, (129) [2024-10-24 11:45:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1394 transitions. [2024-10-24 11:45:12,357 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1394 transitions. Word has length 129 [2024-10-24 11:45:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:12,358 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1394 transitions. [2024-10-24 11:45:12,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:45:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1394 transitions. [2024-10-24 11:45:12,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:45:12,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:12,360 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:12,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:45:12,361 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:12,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:12,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1077001165, now seen corresponding path program 1 times [2024-10-24 11:45:12,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:12,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021872079] [2024-10-24 11:45:12,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:12,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:13,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:13,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:13,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:13,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:13,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:13,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:13,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:13,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:13,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:13,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:13,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:13,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:13,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:13,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:13,518 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:13,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:13,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021872079] [2024-10-24 11:45:13,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021872079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:13,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:13,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:45:13,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891742482] [2024-10-24 11:45:13,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:13,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:45:13,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:13,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:45:13,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:45:13,521 INFO L87 Difference]: Start difference. First operand 978 states and 1394 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:45:14,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:14,467 INFO L93 Difference]: Finished difference Result 1952 states and 2775 transitions. [2024-10-24 11:45:14,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:45:14,467 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-24 11:45:14,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:14,472 INFO L225 Difference]: With dead ends: 1952 [2024-10-24 11:45:14,472 INFO L226 Difference]: Without dead ends: 989 [2024-10-24 11:45:14,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:45:14,474 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 158 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:14,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 823 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 11:45:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2024-10-24 11:45:14,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 638. [2024-10-24 11:45:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 541 states have (on average 1.3585951940850278) internal successors, (735), 545 states have internal predecessors, (735), 82 states have call successors, (82), 14 states have call predecessors, (82), 14 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-24 11:45:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 899 transitions. [2024-10-24 11:45:14,517 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 899 transitions. Word has length 129 [2024-10-24 11:45:14,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:14,518 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 899 transitions. [2024-10-24 11:45:14,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:45:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 899 transitions. [2024-10-24 11:45:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:45:14,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:14,519 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:14,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:45:14,520 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:14,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:14,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1218290704, now seen corresponding path program 1 times [2024-10-24 11:45:14,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:14,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123016308] [2024-10-24 11:45:14,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:14,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:14,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:14,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:14,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:14,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:14,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:14,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:14,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:14,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:14,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:14,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:14,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:14,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:14,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:14,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:14,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:14,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:14,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123016308] [2024-10-24 11:45:14,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123016308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:14,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:14,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:45:14,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928355543] [2024-10-24 11:45:14,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:14,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:45:14,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:14,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:45:14,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:45:14,810 INFO L87 Difference]: Start difference. First operand 638 states and 899 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:15,541 INFO L93 Difference]: Finished difference Result 1407 states and 1992 transitions. [2024-10-24 11:45:15,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:45:15,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-10-24 11:45:15,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:15,548 INFO L225 Difference]: With dead ends: 1407 [2024-10-24 11:45:15,548 INFO L226 Difference]: Without dead ends: 1118 [2024-10-24 11:45:15,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:45:15,551 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 301 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:15,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 817 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:45:15,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2024-10-24 11:45:15,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1112. [2024-10-24 11:45:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 943 states have (on average 1.3616118769883352) internal successors, (1284), 950 states have internal predecessors, (1284), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 137 states have call predecessors, (144), 144 states have call successors, (144) [2024-10-24 11:45:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1572 transitions. [2024-10-24 11:45:15,618 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1572 transitions. Word has length 130 [2024-10-24 11:45:15,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:15,619 INFO L471 AbstractCegarLoop]: Abstraction has 1112 states and 1572 transitions. [2024-10-24 11:45:15,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1572 transitions. [2024-10-24 11:45:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:45:15,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:15,621 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:15,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 11:45:15,621 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:15,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:15,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1387732850, now seen corresponding path program 1 times [2024-10-24 11:45:15,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:15,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830657940] [2024-10-24 11:45:15,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:15,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:15,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:15,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:15,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:15,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:15,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:15,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:15,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:15,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:15,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:15,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:15,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:15,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:15,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:15,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:15,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:15,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:15,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830657940] [2024-10-24 11:45:15,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830657940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:15,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:15,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:45:15,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865820455] [2024-10-24 11:45:15,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:15,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:45:15,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:15,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:45:15,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:45:15,739 INFO L87 Difference]: Start difference. First operand 1112 states and 1572 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:15,797 INFO L93 Difference]: Finished difference Result 1875 states and 2658 transitions. [2024-10-24 11:45:15,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:45:15,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-10-24 11:45:15,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:15,803 INFO L225 Difference]: With dead ends: 1875 [2024-10-24 11:45:15,804 INFO L226 Difference]: Without dead ends: 1112 [2024-10-24 11:45:15,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:45:15,806 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:15,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:45:15,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2024-10-24 11:45:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1112. [2024-10-24 11:45:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 943 states have (on average 1.35949098621421) internal successors, (1282), 950 states have internal predecessors, (1282), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 137 states have call predecessors, (144), 144 states have call successors, (144) [2024-10-24 11:45:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1570 transitions. [2024-10-24 11:45:15,869 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1570 transitions. Word has length 130 [2024-10-24 11:45:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:15,870 INFO L471 AbstractCegarLoop]: Abstraction has 1112 states and 1570 transitions. [2024-10-24 11:45:15,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1570 transitions. [2024-10-24 11:45:15,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:45:15,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:15,872 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:15,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 11:45:15,872 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:15,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:15,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1606587568, now seen corresponding path program 1 times [2024-10-24 11:45:15,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:15,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289648157] [2024-10-24 11:45:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:16,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:16,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:16,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:16,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:16,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:16,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:16,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:16,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:16,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:16,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:16,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:16,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:16,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:16,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:16,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:16,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:16,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289648157] [2024-10-24 11:45:16,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289648157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:16,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:16,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:45:16,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737708443] [2024-10-24 11:45:16,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:16,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:45:16,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:16,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:45:16,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:45:16,703 INFO L87 Difference]: Start difference. First operand 1112 states and 1570 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:17,989 INFO L93 Difference]: Finished difference Result 1351 states and 1901 transitions. [2024-10-24 11:45:17,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 11:45:17,991 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-10-24 11:45:17,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:17,996 INFO L225 Difference]: With dead ends: 1351 [2024-10-24 11:45:17,996 INFO L226 Difference]: Without dead ends: 1118 [2024-10-24 11:45:17,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:45:17,998 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 260 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:17,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1561 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 11:45:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2024-10-24 11:45:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1106. [2024-10-24 11:45:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 937 states have (on average 1.3585912486659553) internal successors, (1273), 944 states have internal predecessors, (1273), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 137 states have call predecessors, (144), 144 states have call successors, (144) [2024-10-24 11:45:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1561 transitions. [2024-10-24 11:45:18,065 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1561 transitions. Word has length 130 [2024-10-24 11:45:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:18,065 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1561 transitions. [2024-10-24 11:45:18,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1561 transitions. [2024-10-24 11:45:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:45:18,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:18,068 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:18,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 11:45:18,068 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:18,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:18,069 INFO L85 PathProgramCache]: Analyzing trace with hash -858887376, now seen corresponding path program 1 times [2024-10-24 11:45:18,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:18,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092068259] [2024-10-24 11:45:18,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:18,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:19,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:19,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:19,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:19,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:19,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:19,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:19,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:19,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:19,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:19,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:19,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:19,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:19,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:19,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:19,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:19,054 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:19,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:19,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092068259] [2024-10-24 11:45:19,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092068259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:19,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:19,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:45:19,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006067735] [2024-10-24 11:45:19,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:19,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:45:19,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:19,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:45:19,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:45:19,057 INFO L87 Difference]: Start difference. First operand 1106 states and 1561 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:20,216 INFO L93 Difference]: Finished difference Result 1874 states and 2644 transitions. [2024-10-24 11:45:20,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 11:45:20,216 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-10-24 11:45:20,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:20,222 INFO L225 Difference]: With dead ends: 1874 [2024-10-24 11:45:20,223 INFO L226 Difference]: Without dead ends: 1117 [2024-10-24 11:45:20,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:45:20,225 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 218 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:20,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1428 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 11:45:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2024-10-24 11:45:20,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1098. [2024-10-24 11:45:20,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 929 states have (on average 1.3573735199138859) internal successors, (1261), 936 states have internal predecessors, (1261), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 137 states have call predecessors, (144), 144 states have call successors, (144) [2024-10-24 11:45:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1549 transitions. [2024-10-24 11:45:20,285 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1549 transitions. Word has length 130 [2024-10-24 11:45:20,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:20,285 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1549 transitions. [2024-10-24 11:45:20,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1549 transitions. [2024-10-24 11:45:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:45:20,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:20,288 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:20,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 11:45:20,289 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:20,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:20,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1676767644, now seen corresponding path program 1 times [2024-10-24 11:45:20,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:20,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123461860] [2024-10-24 11:45:20,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:20,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:20,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:20,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123461860] [2024-10-24 11:45:20,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123461860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:20,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:20,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:45:20,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448284492] [2024-10-24 11:45:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:20,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:45:20,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:20,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:45:20,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:45:20,462 INFO L87 Difference]: Start difference. First operand 1098 states and 1549 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:20,639 INFO L93 Difference]: Finished difference Result 2007 states and 2830 transitions. [2024-10-24 11:45:20,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:45:20,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-10-24 11:45:20,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:20,646 INFO L225 Difference]: With dead ends: 2007 [2024-10-24 11:45:20,646 INFO L226 Difference]: Without dead ends: 1238 [2024-10-24 11:45:20,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:45:20,649 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 94 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:20,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 411 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:45:20,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2024-10-24 11:45:20,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1098. [2024-10-24 11:45:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 929 states have (on average 1.3466092572658772) internal successors, (1251), 936 states have internal predecessors, (1251), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 137 states have call predecessors, (144), 144 states have call successors, (144) [2024-10-24 11:45:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1539 transitions. [2024-10-24 11:45:20,726 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1539 transitions. Word has length 131 [2024-10-24 11:45:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:20,726 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1539 transitions. [2024-10-24 11:45:20,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1539 transitions. [2024-10-24 11:45:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:45:20,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:20,728 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:20,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 11:45:20,728 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:20,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:20,729 INFO L85 PathProgramCache]: Analyzing trace with hash 88419742, now seen corresponding path program 1 times [2024-10-24 11:45:20,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:20,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361572636] [2024-10-24 11:45:20,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:20,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:21,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:21,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361572636] [2024-10-24 11:45:21,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361572636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:21,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:21,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:45:21,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097778152] [2024-10-24 11:45:21,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:21,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:45:21,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:21,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:45:21,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:45:21,046 INFO L87 Difference]: Start difference. First operand 1098 states and 1539 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:21,768 INFO L93 Difference]: Finished difference Result 1327 states and 1853 transitions. [2024-10-24 11:45:21,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:45:21,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-10-24 11:45:21,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:21,775 INFO L225 Difference]: With dead ends: 1327 [2024-10-24 11:45:21,775 INFO L226 Difference]: Without dead ends: 1100 [2024-10-24 11:45:21,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:45:21,777 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 226 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:21,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1146 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:45:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2024-10-24 11:45:21,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 898. [2024-10-24 11:45:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 764 states have (on average 1.3468586387434556) internal successors, (1029), 770 states have internal predecessors, (1029), 114 states have call successors, (114), 19 states have call predecessors, (114), 19 states have return successors, (114), 108 states have call predecessors, (114), 114 states have call successors, (114) [2024-10-24 11:45:21,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1257 transitions. [2024-10-24 11:45:21,834 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1257 transitions. Word has length 131 [2024-10-24 11:45:21,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:21,834 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1257 transitions. [2024-10-24 11:45:21,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:21,835 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1257 transitions. [2024-10-24 11:45:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:45:21,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:21,837 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:21,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 11:45:21,837 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:21,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1350884388, now seen corresponding path program 1 times [2024-10-24 11:45:21,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:21,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281802581] [2024-10-24 11:45:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:21,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:22,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:22,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281802581] [2024-10-24 11:45:22,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281802581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:22,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:22,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:45:22,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832672328] [2024-10-24 11:45:22,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:22,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:45:22,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:22,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:45:22,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:45:22,614 INFO L87 Difference]: Start difference. First operand 898 states and 1257 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:45:22,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:22,900 INFO L93 Difference]: Finished difference Result 1911 states and 2669 transitions. [2024-10-24 11:45:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:45:22,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-10-24 11:45:22,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:22,906 INFO L225 Difference]: With dead ends: 1911 [2024-10-24 11:45:22,906 INFO L226 Difference]: Without dead ends: 1014 [2024-10-24 11:45:22,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:45:22,908 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 50 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:22,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 543 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:45:22,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2024-10-24 11:45:22,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 878. [2024-10-24 11:45:22,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 744 states have (on average 1.3225806451612903) internal successors, (984), 750 states have internal predecessors, (984), 114 states have call successors, (114), 19 states have call predecessors, (114), 19 states have return successors, (114), 108 states have call predecessors, (114), 114 states have call successors, (114) [2024-10-24 11:45:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1212 transitions. [2024-10-24 11:45:22,960 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1212 transitions. Word has length 131 [2024-10-24 11:45:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:22,961 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1212 transitions. [2024-10-24 11:45:22,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:45:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1212 transitions. [2024-10-24 11:45:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:45:22,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:22,964 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:22,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 11:45:22,964 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:22,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:22,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1464678163, now seen corresponding path program 1 times [2024-10-24 11:45:22,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:22,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783637804] [2024-10-24 11:45:22,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:22,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:23,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:23,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783637804] [2024-10-24 11:45:23,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783637804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:23,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:23,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:45:23,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509085190] [2024-10-24 11:45:23,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:23,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:45:23,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:23,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:45:23,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:45:23,691 INFO L87 Difference]: Start difference. First operand 878 states and 1212 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:24,457 INFO L93 Difference]: Finished difference Result 1601 states and 2208 transitions. [2024-10-24 11:45:24,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:45:24,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-10-24 11:45:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:24,462 INFO L225 Difference]: With dead ends: 1601 [2024-10-24 11:45:24,462 INFO L226 Difference]: Without dead ends: 872 [2024-10-24 11:45:24,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:45:24,465 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 311 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:24,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 929 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:45:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-24 11:45:24,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 862. [2024-10-24 11:45:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 728 states have (on average 1.315934065934066) internal successors, (958), 734 states have internal predecessors, (958), 114 states have call successors, (114), 19 states have call predecessors, (114), 19 states have return successors, (114), 108 states have call predecessors, (114), 114 states have call successors, (114) [2024-10-24 11:45:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1186 transitions. [2024-10-24 11:45:24,512 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1186 transitions. Word has length 133 [2024-10-24 11:45:24,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:24,512 INFO L471 AbstractCegarLoop]: Abstraction has 862 states and 1186 transitions. [2024-10-24 11:45:24,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1186 transitions. [2024-10-24 11:45:24,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:45:24,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:24,514 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:24,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 11:45:24,514 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:24,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:24,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1600348629, now seen corresponding path program 1 times [2024-10-24 11:45:24,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:24,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141897782] [2024-10-24 11:45:24,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:24,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:24,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:24,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141897782] [2024-10-24 11:45:24,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141897782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:24,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:24,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:45:24,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202076370] [2024-10-24 11:45:24,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:24,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:45:24,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:24,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:45:24,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:45:24,574 INFO L87 Difference]: Start difference. First operand 862 states and 1186 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:24,648 INFO L93 Difference]: Finished difference Result 1575 states and 2169 transitions. [2024-10-24 11:45:24,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:45:24,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-10-24 11:45:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:24,653 INFO L225 Difference]: With dead ends: 1575 [2024-10-24 11:45:24,654 INFO L226 Difference]: Without dead ends: 862 [2024-10-24 11:45:24,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:45:24,656 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:24,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:45:24,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2024-10-24 11:45:24,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2024-10-24 11:45:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 728 states have (on average 1.3118131868131868) internal successors, (955), 734 states have internal predecessors, (955), 114 states have call successors, (114), 19 states have call predecessors, (114), 19 states have return successors, (114), 108 states have call predecessors, (114), 114 states have call successors, (114) [2024-10-24 11:45:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1183 transitions. [2024-10-24 11:45:24,710 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1183 transitions. Word has length 133 [2024-10-24 11:45:24,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:24,710 INFO L471 AbstractCegarLoop]: Abstraction has 862 states and 1183 transitions. [2024-10-24 11:45:24,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:24,711 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1183 transitions. [2024-10-24 11:45:24,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:45:24,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:24,712 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:24,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 11:45:24,712 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:24,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1819203347, now seen corresponding path program 1 times [2024-10-24 11:45:24,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:24,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447569604] [2024-10-24 11:45:24,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:24,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:25,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:25,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447569604] [2024-10-24 11:45:25,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447569604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:25,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:25,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:45:25,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409022528] [2024-10-24 11:45:25,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:25,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:45:25,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:25,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:45:25,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:45:25,517 INFO L87 Difference]: Start difference. First operand 862 states and 1183 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:26,881 INFO L93 Difference]: Finished difference Result 1565 states and 2134 transitions. [2024-10-24 11:45:26,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 11:45:26,881 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-10-24 11:45:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:26,886 INFO L225 Difference]: With dead ends: 1565 [2024-10-24 11:45:26,886 INFO L226 Difference]: Without dead ends: 785 [2024-10-24 11:45:26,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2024-10-24 11:45:26,888 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 532 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:26,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1204 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 11:45:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-10-24 11:45:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 579. [2024-10-24 11:45:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 485 states have (on average 1.3030927835051547) internal successors, (632), 487 states have internal predecessors, (632), 80 states have call successors, (80), 13 states have call predecessors, (80), 13 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 11:45:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 792 transitions. [2024-10-24 11:45:26,928 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 792 transitions. Word has length 133 [2024-10-24 11:45:26,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:26,929 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 792 transitions. [2024-10-24 11:45:26,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 792 transitions. [2024-10-24 11:45:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 11:45:26,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:26,930 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:26,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 11:45:26,930 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:26,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:26,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1976210494, now seen corresponding path program 1 times [2024-10-24 11:45:26,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:26,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236451062] [2024-10-24 11:45:26,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:26,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:27,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:27,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236451062] [2024-10-24 11:45:27,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236451062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:27,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:27,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:45:27,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983544228] [2024-10-24 11:45:27,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:27,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:45:27,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:27,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:45:27,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:45:27,081 INFO L87 Difference]: Start difference. First operand 579 states and 792 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:27,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:27,141 INFO L93 Difference]: Finished difference Result 1181 states and 1613 transitions. [2024-10-24 11:45:27,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:45:27,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-10-24 11:45:27,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:27,145 INFO L225 Difference]: With dead ends: 1181 [2024-10-24 11:45:27,145 INFO L226 Difference]: Without dead ends: 603 [2024-10-24 11:45:27,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:45:27,149 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:27,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 679 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:45:27,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-10-24 11:45:27,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2024-10-24 11:45:27,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 509 states have (on average 1.2888015717092338) internal successors, (656), 511 states have internal predecessors, (656), 80 states have call successors, (80), 13 states have call predecessors, (80), 13 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 11:45:27,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 816 transitions. [2024-10-24 11:45:27,192 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 816 transitions. Word has length 134 [2024-10-24 11:45:27,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:27,192 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 816 transitions. [2024-10-24 11:45:27,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:27,193 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 816 transitions. [2024-10-24 11:45:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 11:45:27,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:27,194 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:27,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 11:45:27,194 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:27,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:27,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2118341836, now seen corresponding path program 1 times [2024-10-24 11:45:27,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:27,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221110470] [2024-10-24 11:45:27,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:27,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:27,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:27,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221110470] [2024-10-24 11:45:27,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221110470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:27,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:27,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:45:27,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282700334] [2024-10-24 11:45:27,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:27,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:45:27,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:27,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:45:27,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:45:27,255 INFO L87 Difference]: Start difference. First operand 603 states and 816 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:27,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:27,300 INFO L93 Difference]: Finished difference Result 1193 states and 1613 transitions. [2024-10-24 11:45:27,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:45:27,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-10-24 11:45:27,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:27,304 INFO L225 Difference]: With dead ends: 1193 [2024-10-24 11:45:27,304 INFO L226 Difference]: Without dead ends: 591 [2024-10-24 11:45:27,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:45:27,306 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:27,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:45:27,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-10-24 11:45:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2024-10-24 11:45:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 497 states have (on average 1.271629778672032) internal successors, (632), 499 states have internal predecessors, (632), 80 states have call successors, (80), 13 states have call predecessors, (80), 13 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 11:45:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 792 transitions. [2024-10-24 11:45:27,343 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 792 transitions. Word has length 134 [2024-10-24 11:45:27,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:27,343 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 792 transitions. [2024-10-24 11:45:27,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 792 transitions. [2024-10-24 11:45:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 11:45:27,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:27,344 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:27,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 11:45:27,345 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:27,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:27,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1083198055, now seen corresponding path program 1 times [2024-10-24 11:45:27,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:27,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28144320] [2024-10-24 11:45:27,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:27,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:27,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:27,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28144320] [2024-10-24 11:45:27,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28144320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:27,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:27,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:45:27,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239442585] [2024-10-24 11:45:27,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:27,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:45:27,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:27,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:45:27,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:45:27,574 INFO L87 Difference]: Start difference. First operand 591 states and 792 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:27,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:27,754 INFO L93 Difference]: Finished difference Result 1265 states and 1687 transitions. [2024-10-24 11:45:27,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:45:27,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2024-10-24 11:45:27,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:27,759 INFO L225 Difference]: With dead ends: 1265 [2024-10-24 11:45:27,759 INFO L226 Difference]: Without dead ends: 675 [2024-10-24 11:45:27,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:45:27,762 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 57 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:27,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 318 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:45:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-10-24 11:45:27,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 615. [2024-10-24 11:45:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 521 states have (on average 1.2533589251439539) internal successors, (653), 523 states have internal predecessors, (653), 80 states have call successors, (80), 13 states have call predecessors, (80), 13 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 11:45:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 813 transitions. [2024-10-24 11:45:27,820 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 813 transitions. Word has length 136 [2024-10-24 11:45:27,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:27,820 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 813 transitions. [2024-10-24 11:45:27,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:27,821 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 813 transitions. [2024-10-24 11:45:27,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 11:45:27,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:27,822 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:27,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 11:45:27,822 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:27,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1341363493, now seen corresponding path program 1 times [2024-10-24 11:45:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:27,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576482930] [2024-10-24 11:45:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:27,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:28,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:28,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:28,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:28,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:28,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:28,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:28,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:28,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:28,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:28,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:28,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:28,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:28,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:28,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:28,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576482930] [2024-10-24 11:45:28,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576482930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:28,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:28,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:45:28,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106479667] [2024-10-24 11:45:28,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:28,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:45:28,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:28,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:45:28,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:45:28,213 INFO L87 Difference]: Start difference. First operand 615 states and 813 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:28,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:28,685 INFO L93 Difference]: Finished difference Result 1121 states and 1456 transitions. [2024-10-24 11:45:28,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:45:28,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2024-10-24 11:45:28,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:28,689 INFO L225 Difference]: With dead ends: 1121 [2024-10-24 11:45:28,690 INFO L226 Difference]: Without dead ends: 782 [2024-10-24 11:45:28,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:45:28,691 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 188 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:28,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 668 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:45:28,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-10-24 11:45:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 775. [2024-10-24 11:45:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 653 states have (on average 1.218989280245023) internal successors, (796), 658 states have internal predecessors, (796), 101 states have call successors, (101), 20 states have call predecessors, (101), 20 states have return successors, (101), 96 states have call predecessors, (101), 101 states have call successors, (101) [2024-10-24 11:45:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 998 transitions. [2024-10-24 11:45:28,744 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 998 transitions. Word has length 136 [2024-10-24 11:45:28,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:28,744 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 998 transitions. [2024-10-24 11:45:28,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 998 transitions. [2024-10-24 11:45:28,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 11:45:28,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:28,745 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:28,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 11:45:28,746 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:28,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:28,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2042963367, now seen corresponding path program 1 times [2024-10-24 11:45:28,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:28,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692431107] [2024-10-24 11:45:28,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:28,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:29,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:29,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:29,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:29,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:29,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:29,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:29,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:29,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:29,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:29,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:29,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:29,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:29,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:29,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:29,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:29,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:29,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692431107] [2024-10-24 11:45:29,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692431107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:29,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:29,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:45:29,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751300232] [2024-10-24 11:45:29,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:29,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:45:29,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:29,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:45:29,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:45:29,393 INFO L87 Difference]: Start difference. First operand 775 states and 998 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:29,867 INFO L93 Difference]: Finished difference Result 1695 states and 2165 transitions. [2024-10-24 11:45:29,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:45:29,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2024-10-24 11:45:29,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:29,873 INFO L225 Difference]: With dead ends: 1695 [2024-10-24 11:45:29,873 INFO L226 Difference]: Without dead ends: 921 [2024-10-24 11:45:29,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:45:29,876 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 145 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:29,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 524 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:45:29,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-10-24 11:45:29,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 915. [2024-10-24 11:45:29,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 768 states have (on average 1.19921875) internal successors, (921), 776 states have internal predecessors, (921), 120 states have call successors, (120), 26 states have call predecessors, (120), 26 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-24 11:45:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1161 transitions. [2024-10-24 11:45:29,946 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1161 transitions. Word has length 136 [2024-10-24 11:45:29,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:29,949 INFO L471 AbstractCegarLoop]: Abstraction has 915 states and 1161 transitions. [2024-10-24 11:45:29,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:29,950 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1161 transitions. [2024-10-24 11:45:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 11:45:29,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:29,951 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:29,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 11:45:29,951 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:29,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash -819727144, now seen corresponding path program 1 times [2024-10-24 11:45:29,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:29,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134995043] [2024-10-24 11:45:29,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:29,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:30,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:30,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:30,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:30,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:45:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:30,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:30,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:45:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:30,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:45:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:30,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:30,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:45:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:30,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:45:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:30,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:45:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:30,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:30,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:45:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:30,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:30,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:30,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:30,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134995043] [2024-10-24 11:45:30,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134995043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:30,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:30,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:45:30,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006077024] [2024-10-24 11:45:30,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:30,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:45:30,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:30,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:45:30,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:45:30,295 INFO L87 Difference]: Start difference. First operand 915 states and 1161 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:30,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:30,698 INFO L93 Difference]: Finished difference Result 943 states and 1196 transitions. [2024-10-24 11:45:30,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:45:30,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-10-24 11:45:30,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:30,704 INFO L225 Difference]: With dead ends: 943 [2024-10-24 11:45:30,704 INFO L226 Difference]: Without dead ends: 941 [2024-10-24 11:45:30,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:45:30,705 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 104 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:30,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 842 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:45:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-10-24 11:45:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 939. [2024-10-24 11:45:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 792 states have (on average 1.1893939393939394) internal successors, (942), 800 states have internal predecessors, (942), 120 states have call successors, (120), 26 states have call predecessors, (120), 26 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-24 11:45:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1182 transitions. [2024-10-24 11:45:30,791 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1182 transitions. Word has length 137 [2024-10-24 11:45:30,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:30,791 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1182 transitions. [2024-10-24 11:45:30,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:30,791 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1182 transitions. [2024-10-24 11:45:30,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 11:45:30,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:30,792 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:30,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-24 11:45:30,793 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:30,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:30,793 INFO L85 PathProgramCache]: Analyzing trace with hash -544967530, now seen corresponding path program 1 times [2024-10-24 11:45:30,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:30,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502620725] [2024-10-24 11:45:30,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:30,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:45:30,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1320429307] [2024-10-24 11:45:30,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:30,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:45:30,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:45:30,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:45:30,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:45:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:31,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-24 11:45:31,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:45:31,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-24 11:45:31,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-24 11:45:31,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:45:31,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-24 11:45:31,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2024-10-24 11:45:31,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-10-24 11:45:31,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:45:31,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 52 [2024-10-24 11:45:31,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:45:31,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 52 [2024-10-24 11:45:31,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:45:31,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 52 [2024-10-24 11:45:32,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:45:32,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 52 [2024-10-24 11:45:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 278 proven. 48 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-24 11:45:32,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:45:33,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:33,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502620725] [2024-10-24 11:45:33,178 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:45:33,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320429307] [2024-10-24 11:45:33,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320429307] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:45:33,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:45:33,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-10-24 11:45:33,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383444541] [2024-10-24 11:45:33,179 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 11:45:33,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:45:33,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:33,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:45:33,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=559, Unknown=10, NotChecked=0, Total=756 [2024-10-24 11:45:33,181 INFO L87 Difference]: Start difference. First operand 939 states and 1182 transitions. Second operand has 13 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 12 states have internal predecessors, (80), 6 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-24 11:45:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:33,843 INFO L93 Difference]: Finished difference Result 1829 states and 2289 transitions. [2024-10-24 11:45:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 11:45:33,844 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 12 states have internal predecessors, (80), 6 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) Word has length 137 [2024-10-24 11:45:33,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:33,849 INFO L225 Difference]: With dead ends: 1829 [2024-10-24 11:45:33,849 INFO L226 Difference]: Without dead ends: 891 [2024-10-24 11:45:33,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=333, Invalid=917, Unknown=10, NotChecked=0, Total=1260 [2024-10-24 11:45:33,852 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 215 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:33,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 586 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:45:33,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2024-10-24 11:45:33,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 873. [2024-10-24 11:45:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 732 states have (on average 1.1885245901639345) internal successors, (870), 738 states have internal predecessors, (870), 110 states have call successors, (110), 30 states have call predecessors, (110), 30 states have return successors, (110), 104 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-24 11:45:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1090 transitions. [2024-10-24 11:45:33,917 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1090 transitions. Word has length 137 [2024-10-24 11:45:33,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:33,917 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1090 transitions. [2024-10-24 11:45:33,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 12 states have internal predecessors, (80), 6 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-24 11:45:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1090 transitions. [2024-10-24 11:45:33,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 11:45:33,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:33,919 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:33,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:45:34,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:45:34,120 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:34,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:34,121 INFO L85 PathProgramCache]: Analyzing trace with hash -210087398, now seen corresponding path program 1 times [2024-10-24 11:45:34,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:34,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875063932] [2024-10-24 11:45:34,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:34,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:45:34,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218943789] [2024-10-24 11:45:34,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:34,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:45:34,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:45:34,171 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:45:34,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 11:45:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:45:34,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:45:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:45:34,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:45:34,806 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:45:34,807 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:45:34,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 11:45:35,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-10-24 11:45:35,013 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:35,094 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:45:35,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:45:35 BoogieIcfgContainer [2024-10-24 11:45:35,097 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:45:35,097 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:45:35,097 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:45:35,097 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:45:35,098 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:44:57" (3/4) ... [2024-10-24 11:45:35,100 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:45:35,101 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:45:35,102 INFO L158 Benchmark]: Toolchain (without parser) took 38475.09ms. Allocated memory was 159.4MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 102.1MB in the beginning and 415.5MB in the end (delta: -313.4MB). Peak memory consumption was 552.1MB. Max. memory is 16.1GB. [2024-10-24 11:45:35,102 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 159.4MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:45:35,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.56ms. Allocated memory is still 159.4MB. Free memory was 101.7MB in the beginning and 84.5MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:45:35,102 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.28ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 80.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:45:35,102 INFO L158 Benchmark]: Boogie Preprocessor took 81.09ms. Allocated memory is still 159.4MB. Free memory was 80.7MB in the beginning and 76.1MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:45:35,103 INFO L158 Benchmark]: RCFGBuilder took 824.07ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 75.7MB in the beginning and 165.0MB in the end (delta: -89.3MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2024-10-24 11:45:35,103 INFO L158 Benchmark]: TraceAbstraction took 37169.10ms. Allocated memory was 218.1MB in the beginning and 1.0GB in the end (delta: 805.3MB). Free memory was 164.0MB in the beginning and 416.6MB in the end (delta: -252.6MB). Peak memory consumption was 554.8MB. Max. memory is 16.1GB. [2024-10-24 11:45:35,103 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 1.0GB. Free memory was 416.6MB in the beginning and 415.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:45:35,104 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 159.4MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.56ms. Allocated memory is still 159.4MB. Free memory was 101.7MB in the beginning and 84.5MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.28ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 80.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.09ms. Allocated memory is still 159.4MB. Free memory was 80.7MB in the beginning and 76.1MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 824.07ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 75.7MB in the beginning and 165.0MB in the end (delta: -89.3MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * TraceAbstraction took 37169.10ms. Allocated memory was 218.1MB in the beginning and 1.0GB in the end (delta: 805.3MB). Free memory was 164.0MB in the beginning and 416.6MB in the end (delta: -252.6MB). Peak memory consumption was 554.8MB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 1.0GB. Free memory was 416.6MB in the beginning and 415.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L37] unsigned char isInitial = 0; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 25, 1, 16, 16, 4, 2, 64, 0, 16, 128.4, 50.2, 3.8, 25.1 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 25, 1, 16, 16, 4, 2, 64, 0, 16, 128.4, 50.2, 3.8, 25.1 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 25, 1, 16, 16, 4, 2, 64, 0, 16, 128.4, 50.2, 3.8, 25.1 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 25, 1, 16, 16, 4, 2, 64, 0, 16, 128.4, 50.2, 3.8, 25.1 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 25, 1, 16, 16, 4, 2, 64, 0, 16, 128.4, 50.2, 3.8, 25.1 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 25, 1, 16, 16, 4, 2, 64, 0, 16, 128.4, 50.2, 3.8, 25.1 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 25, 1, 16, 16, 4, 2, 64, 0, 16, 128.4, 50.2, 3.8, 25.1 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 25, 1, 16, 16, 4, 2, 64, 0, 16, 128.4, 50.2, 3.8, 25.1 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 25, 1, 16, 16, 4, 2, 64, 0, 16, 128.4, 50.2, 3.8, 25.1 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 25, 1, 16, 16, 4, 2, 64, 0, 16, 128.4, 50.2, 3.8, 25.1 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 25, 1, 16, 16, 4, 2, 64, 0, 16, 128.4, 50.2, 3.8, 25.1 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 25, 1, 16, 16, 4, 2, 64, 0, 16, 128.4, 50.2, 3.8, 25.1 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 25, 1, 16, 16, 4, 2, 64, 0, 16, 128.4, 50.2, 3.8, 25.1 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 25, 1, 16, 16, 4, 2, 64, 0, 16, 128.4, 50.2, 3.8, 25.1 }; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] FCALL updateLastVariables() [L114] CALL updateVariables() [L78] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L79] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L79] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L79] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L80] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L80] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L80] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L81] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L82] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_6 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_6 != 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L86] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] WrapperStruct00.var_1_9 = __VERIFIER_nondet_char() [L89] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] WrapperStruct00.var_1_10 = __VERIFIER_nondet_char() [L92] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 64) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_12 [L95] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_12 [L95] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L97] EXPR WrapperStruct00.var_1_13 [L97] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_13 [L97] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_14 [L99] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_14 [L99] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR (WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR (WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_15 [L101] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_15 [L101] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR (WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR (WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] RET updateVariables() [L115] CALL step() [L56] EXPR WrapperStruct00.var_1_12 [L56] EXPR WrapperStruct00.var_1_13 [L56] EXPR WrapperStruct00.var_1_14 [L56] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L56] EXPR ((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15) [L56] EXPR ((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1] [L56] COND FALSE !(((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) [L59] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L59] COND FALSE !(WrapperStruct00.var_1_2) [L62] EXPR WrapperStruct00.var_1_1 [L62] (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L62] (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) [L62] EXPR WrapperStruct00.var_1_11 [L62] EXPR WrapperStruct00.var_1_6 [L62] (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L62] COND FALSE !((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) [L65] WrapperStruct00.var_1_5 = 5 VAL [WrapperStruct00={4:0}, isInitial=1] [L67] EXPR WrapperStruct00.var_1_11 [L67] unsigned char stepLocal_1 = WrapperStruct00.var_1_11; [L68] EXPR WrapperStruct00.var_1_2 [L68] unsigned char stepLocal_0 = WrapperStruct00.var_1_2; [L69] stepLocal_0 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=16] [L69] stepLocal_0 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) [L69] EXPR WrapperStruct00.var_1_11 [L69] EXPR WrapperStruct00.var_1_11 [L69] stepLocal_0 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=16] [L69] COND TRUE stepLocal_0 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) [L70] EXPR WrapperStruct00.var_1_9 [L70] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L70] COND FALSE !(stepLocal_1 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1 [L106] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5))) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5))) [L106] EXPR WrapperStruct00.var_1_1 [L106] EXPR (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR WrapperStruct00.var_1_6 [L106] EXPR (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)) [L106] EXPR WrapperStruct00.var_1_5 [L106] EXPR ((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5))) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11)))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11)))))) [L106] EXPR WrapperStruct00.var_1_2 [L106] EXPR WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))) [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR WrapperStruct00.var_1_9 [L106] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1 [L106] EXPR (WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11)))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))))) && ((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))))) && ((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) [L106] EXPR WrapperStruct00.var_1_12 [L106] EXPR WrapperStruct00.var_1_13 [L106] EXPR WrapperStruct00.var_1_14 [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15) [L106] EXPR ((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR (((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))))) && ((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L106-L107] return (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))))) && ((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.0s, OverallIterations: 32, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4202 SdHoareTripleChecker+Valid, 11.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4192 mSDsluCounter, 19581 SdHoareTripleChecker+Invalid, 9.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14663 mSDsCounter, 660 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14191 IncrementalHoareTripleChecker+Invalid, 14851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 660 mSolverCounterUnsat, 4918 mSDtfsCounter, 14191 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1579 GetRequests, 1343 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1112occurred in iteration=15, InterpolantAutomatonStates: 243, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 1330 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 4469 NumberOfCodeBlocks, 4469 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 4027 ConstructedInterpolants, 0 QuantifiedInterpolants, 14606 SizeOfPredicates, 3 NumberOfNonLiveVariables, 439 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 31 InterpolantComputations, 30 PerfectInterpolantSequences, 12972/13020 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:45:35,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:45:37,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:45:37,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:45:37,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:45:37,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:45:37,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:45:37,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:45:37,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:45:37,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:45:37,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:45:37,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:45:37,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:45:37,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:45:37,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:45:37,548 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:45:37,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:45:37,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:45:37,549 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:45:37,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:45:37,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:45:37,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:45:37,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:45:37,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:45:37,552 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:45:37,552 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:45:37,552 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:45:37,552 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:45:37,553 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:45:37,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:45:37,553 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:45:37,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:45:37,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:45:37,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:45:37,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:45:37,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:45:37,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:45:37,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:45:37,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:45:37,555 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:45:37,555 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:45:37,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:45:37,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:45:37,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:45:37,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:45:37,559 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:45:37,559 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 [2024-10-24 11:45:37,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:45:37,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:45:37,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:45:37,916 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:45:37,917 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:45:37,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i [2024-10-24 11:45:39,496 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:45:39,717 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:45:39,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i [2024-10-24 11:45:39,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44cc3a969/7cb22d65aa494ba3bbe2b43a31a88e7d/FLAGef5616fae [2024-10-24 11:45:39,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44cc3a969/7cb22d65aa494ba3bbe2b43a31a88e7d [2024-10-24 11:45:39,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:45:39,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:45:39,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:45:39,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:45:39,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:45:39,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:45:39" (1/1) ... [2024-10-24 11:45:39,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55c8fe4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:39, skipping insertion in model container [2024-10-24 11:45:39,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:45:39" (1/1) ... [2024-10-24 11:45:39,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:45:39,975 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i[916,929] [2024-10-24 11:45:40,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:45:40,064 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:45:40,088 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i[916,929] [2024-10-24 11:45:40,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:45:40,180 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:45:40,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:40 WrapperNode [2024-10-24 11:45:40,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:45:40,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:45:40,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:45:40,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:45:40,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:40" (1/1) ... [2024-10-24 11:45:40,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:40" (1/1) ... [2024-10-24 11:45:40,255 INFO L138 Inliner]: procedures = 33, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2024-10-24 11:45:40,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:45:40,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:45:40,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:45:40,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:45:40,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:40" (1/1) ... [2024-10-24 11:45:40,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:40" (1/1) ... [2024-10-24 11:45:40,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:40" (1/1) ... [2024-10-24 11:45:40,317 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 13]. The 15 writes are split as follows [0, 15]. [2024-10-24 11:45:40,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:40" (1/1) ... [2024-10-24 11:45:40,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:40" (1/1) ... [2024-10-24 11:45:40,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:40" (1/1) ... [2024-10-24 11:45:40,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:40" (1/1) ... [2024-10-24 11:45:40,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:40" (1/1) ... [2024-10-24 11:45:40,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:40" (1/1) ... [2024-10-24 11:45:40,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:45:40,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:45:40,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:45:40,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:45:40,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:40" (1/1) ... [2024-10-24 11:45:40,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:45:40,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:45:40,413 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:45:40,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:45:40,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:45:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:45:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:45:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:45:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:45:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:45:40,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:45:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:45:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:45:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:45:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:45:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:45:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:45:40,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:45:40,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:45:40,468 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:45:40,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:45:40,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:45:40,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:45:40,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:45:40,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:45:40,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:45:40,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:45:40,641 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:45:40,644 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:45:47,855 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-10-24 11:45:47,856 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:45:47,912 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:45:47,912 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:45:47,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:47 BoogieIcfgContainer [2024-10-24 11:45:47,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:45:47,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:45:47,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:45:47,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:45:47,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:45:39" (1/3) ... [2024-10-24 11:45:47,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576946e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:47, skipping insertion in model container [2024-10-24 11:45:47,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:40" (2/3) ... [2024-10-24 11:45:47,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576946e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:47, skipping insertion in model container [2024-10-24 11:45:47,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:47" (3/3) ... [2024-10-24 11:45:47,920 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-13.i [2024-10-24 11:45:47,935 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:45:47,936 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:45:47,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:45:48,002 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@263bee9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:45:48,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:45:48,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:45:48,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 11:45:48,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:48,018 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:48,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:48,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:48,024 INFO L85 PathProgramCache]: Analyzing trace with hash -342532188, now seen corresponding path program 1 times [2024-10-24 11:45:48,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:45:48,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157787057] [2024-10-24 11:45:48,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:48,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:48,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:45:48,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:45:48,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:45:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:48,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:45:48,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:45:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-24 11:45:48,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:45:48,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:45:48,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157787057] [2024-10-24 11:45:48,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157787057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:48,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:48,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:45:48,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897273227] [2024-10-24 11:45:48,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:48,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:45:48,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:45:48,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:45:48,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:45:48,612 INFO L87 Difference]: Start difference. First operand has 105 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:45:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:48,680 INFO L93 Difference]: Finished difference Result 207 states and 331 transitions. [2024-10-24 11:45:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:45:48,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2024-10-24 11:45:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:48,693 INFO L225 Difference]: With dead ends: 207 [2024-10-24 11:45:48,693 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 11:45:48,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:45:48,700 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:48,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:45:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 11:45:48,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-24 11:45:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:45:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 154 transitions. [2024-10-24 11:45:48,756 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 154 transitions. Word has length 126 [2024-10-24 11:45:48,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:48,758 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 154 transitions. [2024-10-24 11:45:48,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:45:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 154 transitions. [2024-10-24 11:45:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 11:45:48,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:48,764 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:48,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:45:48,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:48,965 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:48,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:48,966 INFO L85 PathProgramCache]: Analyzing trace with hash 219295054, now seen corresponding path program 1 times [2024-10-24 11:45:48,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:45:48,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566998548] [2024-10-24 11:45:48,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:48,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:48,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:45:48,971 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:45:48,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:45:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:49,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:45:49,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:45:49,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-24 11:45:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:45:49,818 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:45:49,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:45:49,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566998548] [2024-10-24 11:45:49,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566998548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:49,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:49,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:45:49,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442138980] [2024-10-24 11:45:49,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:49,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:45:49,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:45:49,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:45:49,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:45:49,825 INFO L87 Difference]: Start difference. First operand 103 states and 154 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:45:51,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:45:55,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:45:58,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:46:01,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:46:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:01,545 INFO L93 Difference]: Finished difference Result 240 states and 359 transitions. [2024-10-24 11:46:01,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:46:01,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-10-24 11:46:01,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:01,565 INFO L225 Difference]: With dead ends: 240 [2024-10-24 11:46:01,565 INFO L226 Difference]: Without dead ends: 138 [2024-10-24 11:46:01,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:46:01,567 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 46 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:01,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 511 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2024-10-24 11:46:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-24 11:46:01,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 109. [2024-10-24 11:46:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.434782608695652) internal successors, (132), 92 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:46:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 162 transitions. [2024-10-24 11:46:01,582 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 162 transitions. Word has length 126 [2024-10-24 11:46:01,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:01,583 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 162 transitions. [2024-10-24 11:46:01,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:46:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 162 transitions. [2024-10-24 11:46:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 11:46:01,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:01,586 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:01,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:46:01,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:01,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:01,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:01,788 INFO L85 PathProgramCache]: Analyzing trace with hash -791822196, now seen corresponding path program 1 times [2024-10-24 11:46:01,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:01,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481233780] [2024-10-24 11:46:01,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:01,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:01,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:01,792 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:01,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:46:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:02,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:46:02,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:46:02,220 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:02,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:02,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481233780] [2024-10-24 11:46:02,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481233780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:02,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:02,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:46:02,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679475352] [2024-10-24 11:46:02,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:02,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:46:02,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:02,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:46:02,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:46:02,231 INFO L87 Difference]: Start difference. First operand 109 states and 162 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:46:02,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:02,318 INFO L93 Difference]: Finished difference Result 219 states and 326 transitions. [2024-10-24 11:46:02,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:46:02,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-10-24 11:46:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:02,321 INFO L225 Difference]: With dead ends: 219 [2024-10-24 11:46:02,322 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 11:46:02,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:46:02,324 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:02,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 437 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:46:02,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 11:46:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-24 11:46:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:46:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 164 transitions. [2024-10-24 11:46:02,338 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 164 transitions. Word has length 126 [2024-10-24 11:46:02,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:02,338 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 164 transitions. [2024-10-24 11:46:02,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:46:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 164 transitions. [2024-10-24 11:46:02,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 11:46:02,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:02,342 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:02,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:46:02,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:02,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:02,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1326947827, now seen corresponding path program 1 times [2024-10-24 11:46:02,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:02,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683354453] [2024-10-24 11:46:02,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:02,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:02,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:02,549 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:02,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:46:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:02,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:46:02,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:03,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:46:03,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-10-24 11:46:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-10-24 11:46:03,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:03,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:03,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683354453] [2024-10-24 11:46:03,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683354453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:03,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:03,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:46:03,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485653051] [2024-10-24 11:46:03,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:03,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:46:03,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:03,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:46:03,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:46:03,322 INFO L87 Difference]: Start difference. First operand 111 states and 164 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)