/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:19:08,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:19:08,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 21:19:08,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:19:08,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:19:08,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:19:08,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:19:08,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:19:08,421 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:19:08,425 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:19:08,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:19:08,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:19:08,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:19:08,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:19:08,426 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:19:08,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:19:08,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:19:08,427 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:19:08,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:19:08,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:19:08,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:19:08,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:19:08,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:19:08,428 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:19:08,428 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:19:08,428 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:19:08,429 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:19:08,429 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:19:08,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:19:08,429 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:19:08,430 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:19:08,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:19:08,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:19:08,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:19:08,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:19:08,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:19:08,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:19:08,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:19:08,431 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:19:08,431 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:19:08,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:19:08,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:19:08,432 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:19:08,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:19:08,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:19:08,432 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:19:08,432 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 [2023-12-24 21:19:08,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:19:08,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:19:08,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:19:08,619 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:19:08,619 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:19:08,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i [2023-12-24 21:19:09,668 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:19:09,839 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:19:09,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i [2023-12-24 21:19:09,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3efb9beb9/f2349e4454fc454ba8b2b86342c1a650/FLAGcff018686 [2023-12-24 21:19:09,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3efb9beb9/f2349e4454fc454ba8b2b86342c1a650 [2023-12-24 21:19:09,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:19:09,862 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:19:09,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:19:09,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:19:09,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:19:09,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:19:09" (1/1) ... [2023-12-24 21:19:09,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373cc01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:19:09, skipping insertion in model container [2023-12-24 21:19:09,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:19:09" (1/1) ... [2023-12-24 21:19:09,903 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:19:10,102 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i[23220,23233] [2023-12-24 21:19:10,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:19:10,121 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:19:10,158 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i[23220,23233] [2023-12-24 21:19:10,159 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:19:10,177 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:19:10,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:19:10 WrapperNode [2023-12-24 21:19:10,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:19:10,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:19:10,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:19:10,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:19:10,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:19:10" (1/1) ... [2023-12-24 21:19:10,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:19:10" (1/1) ... [2023-12-24 21:19:10,207 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2023-12-24 21:19:10,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:19:10,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:19:10,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:19:10,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:19:10,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:19:10" (1/1) ... [2023-12-24 21:19:10,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:19:10" (1/1) ... [2023-12-24 21:19:10,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:19:10" (1/1) ... [2023-12-24 21:19:10,227 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2023-12-24 21:19:10,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:19:10" (1/1) ... [2023-12-24 21:19:10,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:19:10" (1/1) ... [2023-12-24 21:19:10,234 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:19:10" (1/1) ... [2023-12-24 21:19:10,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:19:10" (1/1) ... [2023-12-24 21:19:10,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:19:10" (1/1) ... [2023-12-24 21:19:10,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:19:10" (1/1) ... [2023-12-24 21:19:10,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:19:10,247 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:19:10,247 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:19:10,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:19:10,247 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:19:10" (1/1) ... [2023-12-24 21:19:10,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:19:10,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:19:10,270 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) [2023-12-24 21:19:10,279 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 [2023-12-24 21:19:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-24 21:19:10,292 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-24 21:19:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 21:19:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 21:19:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:19:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:19:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:19:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:19:10,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:19:10,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:19:10,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:19:10,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:19:10,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:19:10,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:19:10,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:19:10,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:19:10,373 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:19:10,375 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:19:10,424 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-24 21:19:10,541 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:19:10,558 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:19:10,558 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-24 21:19:10,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:19:10 BoogieIcfgContainer [2023-12-24 21:19:10,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:19:10,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:19:10,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:19:10,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:19:10,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:19:09" (1/3) ... [2023-12-24 21:19:10,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a925d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:19:10, skipping insertion in model container [2023-12-24 21:19:10,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:19:10" (2/3) ... [2023-12-24 21:19:10,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a925d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:19:10, skipping insertion in model container [2023-12-24 21:19:10,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:19:10" (3/3) ... [2023-12-24 21:19:10,568 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_search_value-2.i [2023-12-24 21:19:10,586 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:19:10,586 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:19:10,619 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:19:10,625 INFO L357 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, mHoare=true, 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;@7b45e852, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:19:10,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:19:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:19:10,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-24 21:19:10,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:19:10,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:19:10,634 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:19:10,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:19:10,638 INFO L85 PathProgramCache]: Analyzing trace with hash 357278617, now seen corresponding path program 1 times [2023-12-24 21:19:10,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:19:10,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061207475] [2023-12-24 21:19:10,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:19:10,646 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 [2023-12-24 21:19:10,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:19:10,649 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) [2023-12-24 21:19:10,652 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 [2023-12-24 21:19:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:19:10,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:19:10,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:19:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:19:10,772 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:19:10,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:19:10,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061207475] [2023-12-24 21:19:10,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061207475] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:19:10,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:19:10,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:19:10,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515008283] [2023-12-24 21:19:10,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:19:10,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:19:10,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:19:10,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:19:10,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:19:10,812 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:19:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:19:10,831 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2023-12-24 21:19:10,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:19:10,833 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-24 21:19:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:19:10,837 INFO L225 Difference]: With dead ends: 34 [2023-12-24 21:19:10,837 INFO L226 Difference]: Without dead ends: 17 [2023-12-24 21:19:10,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:19:10,842 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:19:10,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:19:10,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-24 21:19:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-24 21:19:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:19:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-24 21:19:10,865 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 8 [2023-12-24 21:19:10,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:19:10,865 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-24 21:19:10,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:19:10,866 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-24 21:19:10,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-24 21:19:10,867 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:19:10,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:19:10,872 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 [2023-12-24 21:19:11,070 WARN L477 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 [2023-12-24 21:19:11,071 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:19:11,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:19:11,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1991764778, now seen corresponding path program 1 times [2023-12-24 21:19:11,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:19:11,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705690335] [2023-12-24 21:19:11,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:19:11,076 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 [2023-12-24 21:19:11,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:19:11,077 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) [2023-12-24 21:19:11,080 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 [2023-12-24 21:19:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:19:11,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:19:11,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:19:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:19:11,195 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:19:11,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:19:11,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705690335] [2023-12-24 21:19:11,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705690335] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:19:11,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:19:11,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:19:11,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375268519] [2023-12-24 21:19:11,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:19:11,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:19:11,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:19:11,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:19:11,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:19:11,201 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:19:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:19:11,266 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2023-12-24 21:19:11,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:19:11,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-24 21:19:11,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:19:11,270 INFO L225 Difference]: With dead ends: 37 [2023-12-24 21:19:11,271 INFO L226 Difference]: Without dead ends: 23 [2023-12-24 21:19:11,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 21:19:11,272 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:19:11,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 45 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:19:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-24 21:19:11,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-12-24 21:19:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:19:11,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-24 21:19:11,281 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2023-12-24 21:19:11,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:19:11,281 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-24 21:19:11,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:19:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-24 21:19:11,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-24 21:19:11,281 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:19:11,282 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:19:11,284 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 [2023-12-24 21:19:11,486 WARN L477 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 [2023-12-24 21:19:11,487 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:19:11,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:19:11,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1438995548, now seen corresponding path program 1 times [2023-12-24 21:19:11,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:19:11,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875300430] [2023-12-24 21:19:11,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:19:11,488 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 [2023-12-24 21:19:11,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:19:11,489 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) [2023-12-24 21:19:11,490 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 [2023-12-24 21:19:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:19:11,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:19:11,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:19:11,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:19:11,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:19:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:19:11,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:19:11,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875300430] [2023-12-24 21:19:11,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875300430] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:19:11,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:19:11,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-24 21:19:11,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370045759] [2023-12-24 21:19:11,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:19:11,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 21:19:11,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:19:11,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 21:19:11,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 21:19:11,633 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:19:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:19:11,789 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2023-12-24 21:19:11,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 21:19:11,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-24 21:19:11,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:19:11,791 INFO L225 Difference]: With dead ends: 53 [2023-12-24 21:19:11,791 INFO L226 Difference]: Without dead ends: 38 [2023-12-24 21:19:11,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2023-12-24 21:19:11,793 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:19:11,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 63 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:19:11,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-24 21:19:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2023-12-24 21:19:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:19:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-12-24 21:19:11,797 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 15 [2023-12-24 21:19:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:19:11,797 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-12-24 21:19:11,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:19:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-12-24 21:19:11,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-24 21:19:11,797 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:19:11,798 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:19:11,804 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 (4)] Forceful destruction successful, exit code 0 [2023-12-24 21:19:12,000 WARN L477 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 [2023-12-24 21:19:12,000 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:19:12,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:19:12,001 INFO L85 PathProgramCache]: Analyzing trace with hash -813781656, now seen corresponding path program 2 times [2023-12-24 21:19:12,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:19:12,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557456630] [2023-12-24 21:19:12,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:19:12,002 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 [2023-12-24 21:19:12,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:19:12,003 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) [2023-12-24 21:19:12,005 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 [2023-12-24 21:19:12,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-24 21:19:12,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:19:12,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:19:12,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:19:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-24 21:19:12,153 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:19:12,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:19:12,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557456630] [2023-12-24 21:19:12,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557456630] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:19:12,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:19:12,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:19:12,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105416971] [2023-12-24 21:19:12,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:19:12,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:19:12,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:19:12,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:19:12,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:19:12,160 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:19:12,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:19:12,239 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2023-12-24 21:19:12,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:19:12,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-24 21:19:12,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:19:12,241 INFO L225 Difference]: With dead ends: 43 [2023-12-24 21:19:12,241 INFO L226 Difference]: Without dead ends: 40 [2023-12-24 21:19:12,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 21:19:12,241 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:19:12,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 23 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:19:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-24 21:19:12,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2023-12-24 21:19:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:19:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-12-24 21:19:12,246 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 30 [2023-12-24 21:19:12,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:19:12,246 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-12-24 21:19:12,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:19:12,246 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-12-24 21:19:12,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-24 21:19:12,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:19:12,247 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:19:12,253 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 (5)] Forceful destruction successful, exit code 0 [2023-12-24 21:19:12,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 [2023-12-24 21:19:12,451 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:19:12,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:19:12,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1302450726, now seen corresponding path program 1 times [2023-12-24 21:19:12,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:19:12,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451515385] [2023-12-24 21:19:12,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:19:12,452 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 [2023-12-24 21:19:12,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:19:12,453 INFO L229 MonitoredProcess]: Starting monitored process 6 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) [2023-12-24 21:19:12,454 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 (6)] Waiting until timeout for monitored process [2023-12-24 21:19:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:19:12,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 21:19:12,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:19:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:19:12,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:19:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:19:12,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:19:12,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451515385] [2023-12-24 21:19:12,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451515385] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:19:12,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:19:12,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-24 21:19:12,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521532891] [2023-12-24 21:19:12,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:19:12,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 21:19:12,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:19:12,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 21:19:12,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-24 21:19:12,789 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:19:13,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:19:13,413 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2023-12-24 21:19:13,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-24 21:19:13,415 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-24 21:19:13,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:19:13,416 INFO L225 Difference]: With dead ends: 85 [2023-12-24 21:19:13,416 INFO L226 Difference]: Without dead ends: 69 [2023-12-24 21:19:13,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=466, Unknown=0, NotChecked=0, Total=702 [2023-12-24 21:19:13,417 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 21:19:13,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 155 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 21:19:13,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-24 21:19:13,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2023-12-24 21:19:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:19:13,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2023-12-24 21:19:13,423 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 35 [2023-12-24 21:19:13,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:19:13,423 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2023-12-24 21:19:13,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:19:13,424 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2023-12-24 21:19:13,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-24 21:19:13,424 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:19:13,425 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:19:13,431 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 (6)] Forceful destruction successful, exit code 0 [2023-12-24 21:19:13,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 [2023-12-24 21:19:13,628 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:19:13,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:19:13,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2036934490, now seen corresponding path program 2 times [2023-12-24 21:19:13,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:19:13,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841610360] [2023-12-24 21:19:13,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:19:13,630 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 [2023-12-24 21:19:13,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:19:13,631 INFO L229 MonitoredProcess]: Starting monitored process 7 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) [2023-12-24 21:19:13,632 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 (7)] Waiting until timeout for monitored process [2023-12-24 21:19:14,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:19:14,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:19:14,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 92 conjunts are in the unsatisfiable core [2023-12-24 21:19:14,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:19:14,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:19:14,598 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:19:14,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-24 21:19:14,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:19:14,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-24 21:19:14,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:14,737 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-12-24 21:19:14,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-12-24 21:19:14,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:14,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:14,990 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-12-24 21:19:14,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-12-24 21:19:15,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:15,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:15,202 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-12-24 21:19:15,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-12-24 21:19:15,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:15,357 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-12-24 21:19:15,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-12-24 21:19:15,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:15,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:15,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:15,524 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-12-24 21:19:15,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-12-24 21:19:15,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:15,665 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-12-24 21:19:15,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-12-24 21:19:15,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:15,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:15,805 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-12-24 21:19:15,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-12-24 21:19:15,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:15,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:15,985 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-12-24 21:19:15,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-12-24 21:19:16,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:16,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:16,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:16,115 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-12-24 21:19:16,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-12-24 21:19:16,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:16,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 21:19:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 129 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-12-24 21:19:16,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:19:16,263 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_393) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32)))) is different from false [2023-12-24 21:19:16,278 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_21|))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_393) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2023-12-24 21:19:28,092 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (_ BitVec 1)) (v_ArrVal_387 (_ BitVec 1)) (v_ArrVal_382 (_ BitVec 1)) (|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_22| (_ BitVec 32)) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_390 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_377))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_382))) (or (not (= (_ bv2 32) (select (select (store (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_381) |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_386) |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_390) |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_393) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= (select (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_387) |v_ULTIMATE.start_main_~t~0#1.base_21|) (_ bv0 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_24|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_23|))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_22|))))))) is different from false [2023-12-24 21:19:35,883 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (_ BitVec 1)) (v_ArrVal_387 (_ BitVec 1)) (v_ArrVal_367 (_ BitVec 1)) (v_ArrVal_373 (_ BitVec 1)) (v_ArrVal_382 (_ BitVec 1)) (v_ArrVal_369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_26| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_22| (_ BitVec 32)) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_390 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_367))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_373))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_377))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_382))) (or (not (= (select (select (store (store (store (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_369) |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_376) |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_381) |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_386) |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_390) |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_393) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_22|))) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_24|) (_ bv0 1))) (not (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_387) |v_ULTIMATE.start_main_~t~0#1.base_21|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_26|))) (not (= (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_23|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_25|))))))))) is different from false [2023-12-24 21:19:40,814 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (_ BitVec 1)) (v_ArrVal_387 (_ BitVec 1)) (v_ArrVal_367 (_ BitVec 1)) (v_ArrVal_362 (_ BitVec 1)) (v_ArrVal_373 (_ BitVec 1)) (v_ArrVal_382 (_ BitVec 1)) (v_ArrVal_369 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_27| (_ BitVec 32)) (v_ArrVal_376 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_ArrVal_366 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_26| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_22| (_ BitVec 32)) (v_ArrVal_396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_21| (_ BitVec 32)) (v_ArrVal_390 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_362))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_367))) (let ((.cse4 (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_373))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_377))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_382))) (or (not (= (select (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_387) |v_ULTIMATE.start_main_~t~0#1.base_21|) (_ bv0 1))) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_25|) (_ bv0 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_27|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_26|))) (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_366) |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_369) |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_376) |v_ULTIMATE.start_main_~t~0#1.base_25| v_ArrVal_381) |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_386) |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_390) |v_ULTIMATE.start_main_~t~0#1.base_22| v_ArrVal_393) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_396) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv2 32))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_22|))) (not (= (_ bv0 1) (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_23|))) (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_24|)))))))))) is different from false [2023-12-24 21:20:23,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:20:23,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 57