/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-simple/dll2n_insert_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:29:36,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:29:36,364 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:29:36,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:29:36,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:29:36,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:29:36,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:29:36,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:29:36,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:29:36,388 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:29:36,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:29:36,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:29:36,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:29:36,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:29:36,390 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:29:36,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:29:36,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:29:36,391 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:29:36,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:29:36,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:29:36,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:29:36,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:29:36,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:29:36,393 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:29:36,393 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:29:36,394 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:29:36,394 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:29:36,394 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:29:36,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:29:36,395 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:29:36,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:29:36,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:29:36,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:29:36,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:29:36,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:29:36,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:29:36,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:29:36,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:29:36,397 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:29:36,398 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:29:36,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:29:36,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:29:36,399 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:29:36,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:29:36,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:29:36,399 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:29:36,399 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:29:36,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:29:36,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:29:36,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:29:36,599 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:29:36,600 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:29:36,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i [2023-12-24 21:29:37,718 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:29:37,955 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:29:37,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_unequal.i [2023-12-24 21:29:37,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a48804399/d165a2cce89345e7a58baea7333299b5/FLAG522492283 [2023-12-24 21:29:37,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a48804399/d165a2cce89345e7a58baea7333299b5 [2023-12-24 21:29:37,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:29:37,983 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:29:37,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:29:37,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:29:37,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:29:37,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:29:37" (1/1) ... [2023-12-24 21:29:37,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55c616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:37, skipping insertion in model container [2023-12-24 21:29:37,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:29:37" (1/1) ... [2023-12-24 21:29:38,040 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:29:38,304 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-simple/dll2n_insert_unequal.i[24989,25002] [2023-12-24 21:29:38,308 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:29:38,319 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:29:38,362 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-simple/dll2n_insert_unequal.i[24989,25002] [2023-12-24 21:29:38,363 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:29:38,388 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:29:38,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:38 WrapperNode [2023-12-24 21:29:38,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:29:38,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:29:38,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:29:38,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:29:38,395 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:29:38" (1/1) ... [2023-12-24 21:29:38,419 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:29:38" (1/1) ... [2023-12-24 21:29:38,441 INFO L138 Inliner]: procedures = 130, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 169 [2023-12-24 21:29:38,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:29:38,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:29:38,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:29:38,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:29:38,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:38" (1/1) ... [2023-12-24 21:29:38,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:38" (1/1) ... [2023-12-24 21:29:38,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:38" (1/1) ... [2023-12-24 21:29:38,486 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 8, 21]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 14 writes are split as follows [0, 1, 13]. [2023-12-24 21:29:38,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:38" (1/1) ... [2023-12-24 21:29:38,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:38" (1/1) ... [2023-12-24 21:29:38,497 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:38" (1/1) ... [2023-12-24 21:29:38,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:38" (1/1) ... [2023-12-24 21:29:38,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:38" (1/1) ... [2023-12-24 21:29:38,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:38" (1/1) ... [2023-12-24 21:29:38,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:29:38,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:29:38,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:29:38,526 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:29:38,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:38" (1/1) ... [2023-12-24 21:29:38,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:29:38,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:29:38,562 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:29:38,572 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:29:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-24 21:29:38,590 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-24 21:29:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 21:29:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 21:29:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 21:29:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:29:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:29:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-24 21:29:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:29:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:29:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-24 21:29:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:29:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:29:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-24 21:29:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:29:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:29:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:29:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 21:29:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-24 21:29:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-24 21:29:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-24 21:29:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:29:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:29:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 21:29:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:29:38,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:29:38,706 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:29:38,708 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:29:38,730 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-24 21:29:39,130 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:29:39,157 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:29:39,157 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-24 21:29:39,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:29:39 BoogieIcfgContainer [2023-12-24 21:29:39,158 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:29:39,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:29:39,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:29:39,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:29:39,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:29:37" (1/3) ... [2023-12-24 21:29:39,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181328fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:29:39, skipping insertion in model container [2023-12-24 21:29:39,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:29:38" (2/3) ... [2023-12-24 21:29:39,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181328fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:29:39, skipping insertion in model container [2023-12-24 21:29:39,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:29:39" (3/3) ... [2023-12-24 21:29:39,167 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2023-12-24 21:29:39,182 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:29:39,183 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:29:39,226 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:29:39,231 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;@2f57e23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:29:39,231 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:29:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 28 states have (on average 1.75) internal successors, (49), 30 states have internal predecessors, (49), 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:29:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 21:29:39,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:39,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:39,248 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:39,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:39,251 INFO L85 PathProgramCache]: Analyzing trace with hash 221915133, now seen corresponding path program 1 times [2023-12-24 21:29:39,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:39,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654729038] [2023-12-24 21:29:39,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:39,262 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:29:39,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:39,265 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:29:39,267 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:29:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:39,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:29:39,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:39,485 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:29:39,486 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:29:39,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:39,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654729038] [2023-12-24 21:29:39,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654729038] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:29:39,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:29:39,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:29:39,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045119128] [2023-12-24 21:29:39,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:29:39,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:29:39,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:39,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:29:39,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:29:39,527 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.75) internal successors, (49), 30 states have internal predecessors, (49), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:29:39,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:39,606 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2023-12-24 21:29:39,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:29:39,608 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2023-12-24 21:29:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:39,615 INFO L225 Difference]: With dead ends: 57 [2023-12-24 21:29:39,615 INFO L226 Difference]: Without dead ends: 24 [2023-12-24 21:29:39,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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:29:39,622 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 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.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:39,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:29:39,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-24 21:29:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-24 21:29:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 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:29:39,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2023-12-24 21:29:39,653 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 12 [2023-12-24 21:29:39,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:39,653 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2023-12-24 21:29:39,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:29:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2023-12-24 21:29:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 21:29:39,655 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:39,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:39,661 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 (2)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:39,860 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:29:39,860 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:39,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash 4252586, now seen corresponding path program 1 times [2023-12-24 21:29:39,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:39,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263342093] [2023-12-24 21:29:39,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:39,862 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:29:39,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:39,863 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:29:39,868 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:29:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:40,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:29:40,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:40,044 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:29:40,045 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:29:40,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:40,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263342093] [2023-12-24 21:29:40,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263342093] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:29:40,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:29:40,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:29:40,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461846475] [2023-12-24 21:29:40,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:29:40,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:29:40,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:40,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:29:40,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:29:40,052 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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:29:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:40,147 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2023-12-24 21:29:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:29:40,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2023-12-24 21:29:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:40,151 INFO L225 Difference]: With dead ends: 47 [2023-12-24 21:29:40,151 INFO L226 Difference]: Without dead ends: 29 [2023-12-24 21:29:40,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:29:40,152 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:40,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 57 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:29:40,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-24 21:29:40,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2023-12-24 21:29:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 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:29:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2023-12-24 21:29:40,161 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 12 [2023-12-24 21:29:40,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:40,161 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2023-12-24 21:29:40,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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:29:40,161 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2023-12-24 21:29:40,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-24 21:29:40,162 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:40,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:40,169 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:29:40,369 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:29:40,369 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:40,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:40,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1675711004, now seen corresponding path program 1 times [2023-12-24 21:29:40,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:40,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528192884] [2023-12-24 21:29:40,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:40,371 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:29:40,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:40,372 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:29:40,376 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:29:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:40,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:29:40,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:40,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:40,565 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:29:40,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:40,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528192884] [2023-12-24 21:29:40,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528192884] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:29:40,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:29:40,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:29:40,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559811431] [2023-12-24 21:29:40,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:29:40,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:29:40,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:40,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:29:40,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:29:40,567 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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:29:40,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:40,748 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2023-12-24 21:29:40,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:29:40,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2023-12-24 21:29:40,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:40,751 INFO L225 Difference]: With dead ends: 52 [2023-12-24 21:29:40,752 INFO L226 Difference]: Without dead ends: 29 [2023-12-24 21:29:40,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:29:40,753 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:40,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:29:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-24 21:29:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-12-24 21:29:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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:29:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-12-24 21:29:40,757 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 17 [2023-12-24 21:29:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:40,758 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-12-24 21:29:40,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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:29:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-12-24 21:29:40,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-24 21:29:40,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:40,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:40,765 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:29:40,964 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:29:40,965 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:40,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:40,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1088904990, now seen corresponding path program 1 times [2023-12-24 21:29:40,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:40,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088421532] [2023-12-24 21:29:40,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:40,966 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:29:40,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:40,967 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:29:40,970 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:29:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:41,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:29:41,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:41,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:41,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:41,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:41,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088421532] [2023-12-24 21:29:41,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088421532] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:29:41,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:41,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-24 21:29:41,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134316323] [2023-12-24 21:29:41,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:41,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 21:29:41,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:41,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 21:29:41,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:29:41,200 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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:29:41,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:41,343 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2023-12-24 21:29:41,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:29:41,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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) Word has length 17 [2023-12-24 21:29:41,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:41,346 INFO L225 Difference]: With dead ends: 52 [2023-12-24 21:29:41,346 INFO L226 Difference]: Without dead ends: 34 [2023-12-24 21:29:41,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:29:41,347 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:41,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 140 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:29:41,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-24 21:29:41,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2023-12-24 21:29:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 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:29:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2023-12-24 21:29:41,353 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 17 [2023-12-24 21:29:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:41,353 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2023-12-24 21:29:41,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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:29:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2023-12-24 21:29:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-24 21:29:41,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:41,354 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:41,362 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 (5)] Ended with exit code 0 [2023-12-24 21:29:41,558 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:29:41,559 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:41,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:41,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1157750568, now seen corresponding path program 1 times [2023-12-24 21:29:41,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:41,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357977806] [2023-12-24 21:29:41,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:41,560 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:29:41,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:41,561 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:29:41,562 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:29:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:41,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:29:41,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 21:29:41,807 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:29:41,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:41,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357977806] [2023-12-24 21:29:41,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357977806] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:29:41,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:29:41,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:29:41,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473793760] [2023-12-24 21:29:41,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:29:41,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:29:41,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:41,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:29:41,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:29:41,809 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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:29:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:41,885 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2023-12-24 21:29:41,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:29:41,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 22 [2023-12-24 21:29:41,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:41,886 INFO L225 Difference]: With dead ends: 45 [2023-12-24 21:29:41,886 INFO L226 Difference]: Without dead ends: 31 [2023-12-24 21:29:41,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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:29:41,887 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:41,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 55 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:29:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-24 21:29:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-24 21:29:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 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:29:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2023-12-24 21:29:41,892 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 22 [2023-12-24 21:29:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:41,892 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2023-12-24 21:29:41,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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:29:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2023-12-24 21:29:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 21:29:41,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:41,893 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:41,901 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:29:42,094 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:29:42,094 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:42,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2111998660, now seen corresponding path program 1 times [2023-12-24 21:29:42,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:42,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683812326] [2023-12-24 21:29:42,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:42,095 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:29:42,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:42,096 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:29:42,098 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:29:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:42,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-24 21:29:42,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:42,403 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:29:42,509 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:29:42,510 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:29:42,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-24 21:29:42,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-12-24 21:29:42,678 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:29:42,678 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-12-24 21:29:42,690 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 24 treesize of output 11 [2023-12-24 21:29:42,843 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:29:42,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:29:43,014 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 20 treesize of output 15 [2023-12-24 21:29:43,026 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 37 treesize of output 26 [2023-12-24 21:29:43,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 40 treesize of output 16 [2023-12-24 21:29:43,278 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 39 treesize of output 15 [2023-12-24 21:29:43,287 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 20 treesize of output 15 [2023-12-24 21:29:43,341 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 20 treesize of output 15 [2023-12-24 21:29:43,387 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 19 treesize of output 11 [2023-12-24 21:29:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:29:43,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:43,657 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_379 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_380) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_379 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse0 (select v_ArrVal_379 .cse0))))))) is different from false [2023-12-24 21:29:43,693 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_379 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~last~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_377) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0) v_ArrVal_380) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_379 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 (select v_ArrVal_379 .cse0))))))) is different from false [2023-12-24 21:29:43,901 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 84 treesize of output 64 [2023-12-24 21:29:43,905 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 68 treesize of output 48 [2023-12-24 21:29:43,930 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_379 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_373 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) (or (= (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_377) (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_375) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0) v_ArrVal_380) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_379 (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_373) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0 (select v_ArrVal_379 .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) (_ bv0 1)))))) is different from false [2023-12-24 21:29:44,001 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_379 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_373 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) (_ bv0 1))) (not (= v_ArrVal_379 (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_373) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_379 .cse0)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_377) (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_375) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) v_ArrVal_380) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) is different from false [2023-12-24 21:29:44,035 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_379 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_373 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_node_create_~temp~0#1.base_15| (_ BitVec 32))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_370)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (or (not (= v_ArrVal_379 (store (select (store .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_373) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_379 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_377) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_372) |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_375) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_380) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_15|) (_ bv0 1)))))) is different from false [2023-12-24 21:29:44,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:29:44,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 52 [2023-12-24 21:29:44,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:29:44,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 147 [2023-12-24 21:29:44,154 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 292 treesize of output 262 [2023-12-24 21:29:44,183 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 93 treesize of output 89 [2023-12-24 21:29:44,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 66 treesize of output 50 [2023-12-24 21:29:44,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:29:44,213 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 77 [2023-12-24 21:29:44,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 41 treesize of output 33 [2023-12-24 21:29:44,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 84 treesize of output 80 [2023-12-24 21:29:44,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 46 [2023-12-24 21:29:44,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:29:44,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 78 [2023-12-24 21:29:44,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:29:44,300 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2023-12-24 21:29:44,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 8 [2023-12-24 21:29:44,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 8 [2023-12-24 21:29:44,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 8 [2023-12-24 21:29:44,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 8 [2023-12-24 21:29:44,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-24 21:29:44,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 17 [2023-12-24 21:29:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-12-24 21:29:52,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:52,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683812326] [2023-12-24 21:29:52,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683812326] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:29:52,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:52,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-12-24 21:29:52,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607364306] [2023-12-24 21:29:52,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:52,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-24 21:29:52,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:52,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-24 21:29:52,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=514, Unknown=18, NotChecked=250, Total=870 [2023-12-24 21:29:52,499 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 30 states, 30 states have (on average 1.5) internal successors, (45), 29 states have internal predecessors, (45), 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:29:57,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:57,369 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2023-12-24 21:29:57,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 21:29:57,369 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.5) internal successors, (45), 29 states have internal predecessors, (45), 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 23 [2023-12-24 21:29:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:57,370 INFO L225 Difference]: With dead ends: 58 [2023-12-24 21:29:57,370 INFO L226 Difference]: Without dead ends: 56 [2023-12-24 21:29:57,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=150, Invalid=781, Unknown=19, NotChecked=310, Total=1260 [2023-12-24 21:29:57,371 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 54 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:57,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 197 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 532 Invalid, 0 Unknown, 330 Unchecked, 4.3s Time] [2023-12-24 21:29:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-24 21:29:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 37. [2023-12-24 21:29:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 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:29:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2023-12-24 21:29:57,377 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 23 [2023-12-24 21:29:57,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:57,377 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2023-12-24 21:29:57,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.5) internal successors, (45), 29 states have internal predecessors, (45), 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:29:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2023-12-24 21:29:57,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-24 21:29:57,378 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:57,378 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:57,391 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 (7)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:57,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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:29:57,585 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:57,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash -215542309, now seen corresponding path program 1 times [2023-12-24 21:29:57,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:57,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592606258] [2023-12-24 21:29:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:57,590 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:29:57,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:57,591 INFO L229 MonitoredProcess]: Starting monitored process 8 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:29:57,594 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 (8)] Waiting until timeout for monitored process [2023-12-24 21:29:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:57,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 21:29:57,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:57,768 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 16 treesize of output 8 [2023-12-24 21:29:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:29:57,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:29:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:29:57,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:57,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592606258] [2023-12-24 21:29:57,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592606258] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:29:57,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:29:57,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2023-12-24 21:29:57,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606701367] [2023-12-24 21:29:57,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:29:57,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 21:29:57,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:57,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 21:29:57,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 21:29:57,815 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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:29:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:58,541 INFO L93 Difference]: Finished difference Result 68 states and 96 transitions. [2023-12-24 21:29:58,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 21:29:58,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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) Word has length 24 [2023-12-24 21:29:58,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:58,543 INFO L225 Difference]: With dead ends: 68 [2023-12-24 21:29:58,543 INFO L226 Difference]: Without dead ends: 38 [2023-12-24 21:29:58,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:29:58,544 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:58,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 122 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 21:29:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-24 21:29:58,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2023-12-24 21:29:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 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:29:58,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2023-12-24 21:29:58,563 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 24 [2023-12-24 21:29:58,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:58,563 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2023-12-24 21:29:58,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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:29:58,564 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2023-12-24 21:29:58,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-24 21:29:58,564 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:58,564 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:58,571 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 (8)] Forceful destruction successful, exit code 0 [2023-12-24 21:29:58,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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:29:58,772 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:58,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:58,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1047394134, now seen corresponding path program 1 times [2023-12-24 21:29:58,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:58,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501172692] [2023-12-24 21:29:58,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:29:58,773 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:29:58,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:58,774 INFO L229 MonitoredProcess]: Starting monitored process 9 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:29:58,791 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 (9)] Waiting until timeout for monitored process [2023-12-24 21:29:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:29:58,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 21:29:58,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:59,038 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 16 treesize of output 8 [2023-12-24 21:29:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-24 21:29:59,056 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:29:59,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:29:59,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501172692] [2023-12-24 21:29:59,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501172692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:29:59,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:29:59,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 21:29:59,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759368949] [2023-12-24 21:29:59,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:29:59,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 21:29:59,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:29:59,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 21:29:59,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-24 21:29:59,057 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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:29:59,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:29:59,515 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2023-12-24 21:29:59,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 21:29:59,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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) Word has length 24 [2023-12-24 21:29:59,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:29:59,517 INFO L225 Difference]: With dead ends: 58 [2023-12-24 21:29:59,517 INFO L226 Difference]: Without dead ends: 51 [2023-12-24 21:29:59,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:29:59,518 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 74 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 21:29:59,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 83 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 21:29:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-24 21:29:59,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2023-12-24 21:29:59,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 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:29:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2023-12-24 21:29:59,525 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 24 [2023-12-24 21:29:59,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:29:59,525 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2023-12-24 21:29:59,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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:29:59,525 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2023-12-24 21:29:59,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-24 21:29:59,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:29:59,526 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:29:59,532 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 (9)] Ended with exit code 0 [2023-12-24 21:29:59,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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:29:59,729 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:29:59,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:29:59,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1628918440, now seen corresponding path program 2 times [2023-12-24 21:29:59,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:29:59,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301852619] [2023-12-24 21:29:59,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:29:59,730 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:29:59,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:29:59,731 INFO L229 MonitoredProcess]: Starting monitored process 10 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:29:59,735 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 (10)] Waiting until timeout for monitored process [2023-12-24 21:29:59,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:29:59,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:29:59,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 21:29:59,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:29:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 21:29:59,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:30:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 21:30:00,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:30:00,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301852619] [2023-12-24 21:30:00,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301852619] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:30:00,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:30:00,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-24 21:30:00,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667607111] [2023-12-24 21:30:00,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:30:00,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 21:30:00,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:30:00,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 21:30:00,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-24 21:30:00,618 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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:30:00,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:30:00,748 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2023-12-24 21:30:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:30:00,749 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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 24 [2023-12-24 21:30:00,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:30:00,749 INFO L225 Difference]: With dead ends: 48 [2023-12-24 21:30:00,749 INFO L226 Difference]: Without dead ends: 31 [2023-12-24 21:30:00,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-12-24 21:30:00,750 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 48 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:30:00,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 127 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:30:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-24 21:30:00,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-24 21:30:00,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 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:30:00,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-12-24 21:30:00,756 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 24 [2023-12-24 21:30:00,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:30:00,756 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-12-24 21:30:00,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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:30:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-12-24 21:30:00,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-24 21:30:00,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:30:00,757 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:30:00,764 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 (10)] Forceful destruction successful, exit code 0 [2023-12-24 21:30:00,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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:30:00,964 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:30:00,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:30:00,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1888805217, now seen corresponding path program 1 times [2023-12-24 21:30:00,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:30:00,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206915151] [2023-12-24 21:30:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:30:00,964 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:30:00,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:30:00,965 INFO L229 MonitoredProcess]: Starting monitored process 11 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:30:00,966 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 (11)] Waiting until timeout for monitored process [2023-12-24 21:30:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:30:01,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:30:01,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:30:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-24 21:30:01,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:30:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-24 21:30:01,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:30:01,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206915151] [2023-12-24 21:30:01,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206915151] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:30:01,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:30:01,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-24 21:30:01,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246680511] [2023-12-24 21:30:01,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:30:01,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 21:30:01,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:30:01,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 21:30:01,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-24 21:30:01,778 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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:30:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:30:01,920 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2023-12-24 21:30:01,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 21:30:01,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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 25 [2023-12-24 21:30:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:30:01,921 INFO L225 Difference]: With dead ends: 41 [2023-12-24 21:30:01,921 INFO L226 Difference]: Without dead ends: 32 [2023-12-24 21:30:01,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-24 21:30:01,922 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 42 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:30:01,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 83 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:30:01,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-24 21:30:01,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-12-24 21:30:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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:30:01,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-12-24 21:30:01,926 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 25 [2023-12-24 21:30:01,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:30:01,927 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-12-24 21:30:01,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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:30:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-12-24 21:30:01,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-24 21:30:01,927 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:30:01,927 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:30:01,932 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 (11)] Forceful destruction successful, exit code 0 [2023-12-24 21:30:02,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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:30:02,132 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:30:02,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:30:02,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1576525531, now seen corresponding path program 1 times [2023-12-24 21:30:02,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:30:02,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659471740] [2023-12-24 21:30:02,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:30:02,133 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:30:02,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:30:02,134 INFO L229 MonitoredProcess]: Starting monitored process 12 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:30:02,142 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 (12)] Waiting until timeout for monitored process [2023-12-24 21:30:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:30:02,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-24 21:30:02,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:30:02,440 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:30:02,476 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 21:30:02,476 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:30:02,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-12-24 21:30:02,573 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 21:30:02,573 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2023-12-24 21:30:02,710 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-24 21:30:02,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-24 21:30:02,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:30:02,929 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 48 treesize of output 31 [2023-12-24 21:30:03,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:30:03,219 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 44 treesize of output 26 [2023-12-24 21:30:03,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 24 treesize of output 20 [2023-12-24 21:30:03,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 49 [2023-12-24 21:30:03,269 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-24 21:30:03,269 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 73 [2023-12-24 21:30:03,289 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 36 treesize of output 15 [2023-12-24 21:30:03,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 49 treesize of output 19 [2023-12-24 21:30:03,378 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 63 treesize of output 40 [2023-12-24 21:30:03,391 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 20 treesize of output 15 [2023-12-24 21:30:03,407 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 24 treesize of output 19 [2023-12-24 21:30:03,473 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 61 treesize of output 37 [2023-12-24 21:30:03,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-12-24 21:30:03,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-24 21:30:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:30:03,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:30:03,836 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_794) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_792) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_793) .cse0) .cse1))))) is different from false [2023-12-24 21:30:03,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:03,866 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 1 case distinctions, treesize of input 76 treesize of output 77 [2023-12-24 21:30:03,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:03,954 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 286 treesize of output 285 [2023-12-24 21:30:03,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 134 treesize of output 126 [2023-12-24 21:30:03,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 254 treesize of output 238 [2023-12-24 21:30:11,053 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse5)) (.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse6 (bvadd (_ bv4 32) .cse12)) (.cse2 (bvadd |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| (_ bv8 32))) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (.cse17 (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse5))) (let ((.cse0 (not .cse17)) (.cse11 (and (or .cse13 (and (or .cse17 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_53 (_ BitVec 32)) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (= (select (select (store (store .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_794) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_792) .cse5) .cse6)) v_arrayElimCell_53) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_789 (store (store (select .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_789 .cse2)) .cse3 (select v_ArrVal_789 .cse3)))))))) (forall ((v_arrayElimCell_53 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse24 (select (store (store .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_794) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_792) .cse5) .cse6)))) (or (= (select .cse24 v_arrayElimCell_53) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 v_arrayElimCell_56))))) (not (= v_ArrVal_789 (store (store (select .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_789 .cse2)) .cse3 (select v_ArrVal_789 .cse3))))))))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_53 (_ BitVec 32)) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (let ((.cse26 (select (store (store .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_794) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_792) .cse5) .cse6)))) (or (= (select .cse26 v_arrayElimCell_53) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse26 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_789 (store (store (select .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_789 .cse2)) .cse3 (select v_ArrVal_789 .cse3)))))))) .cse17) (forall ((v_arrayElimCell_53 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse28 (select (store (store .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_794) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_792) .cse5) .cse6)))) (or (= (select .cse28 v_arrayElimCell_53) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse28 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 v_arrayElimCell_56))))) (not (= v_ArrVal_789 (store (store (select .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_789 .cse2)) .cse3 (select v_ArrVal_789 .cse3)))))))))) (and (or .cse0 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (not (= v_ArrVal_789 (store (store (select .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_789 .cse2)) .cse3 (select v_ArrVal_789 .cse3)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_794) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_792) .cse5) .cse6)) v_arrayElimCell_56)))))) (forall ((v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse7 (select (store (store .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_794) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_792) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= (select .cse7 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 v_arrayElimCell_56))))) (not (= v_ArrVal_789 (store (store (select .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_789 .cse2)) .cse3 (select v_ArrVal_789 .cse3))))))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (let ((.cse9 (select (store (store .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_794) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_792) .cse5) .cse6)))) (or (= (select .cse9 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_789 (store (store (select .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_789 .cse2)) .cse3 (select v_ArrVal_789 .cse3)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 v_arrayElimCell_56)))))) .cse0) (or .cse11 (= .cse12 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|)) (or (not .cse13) (and (forall ((v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse14 (select (store (store .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_794) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_792) .cse5) .cse6)))) (or (forall ((v_arrayElimCell_55 (_ BitVec 32))) (= (select .cse14 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 v_arrayElimCell_56))))) (not (= v_ArrVal_789 (store (store (select .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_789 .cse2)) .cse3 (select v_ArrVal_789 .cse3))))))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (= (select (select (store (store .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_794) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_792) .cse5) .cse6)) v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_789 (store (store (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_789 .cse2)) .cse3 (select v_ArrVal_789 .cse3))))))) .cse17))) (or (= .cse5 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse11) (or .cse17 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (let ((.cse18 (select (store (store .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_794) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_792) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= (select .cse18 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_789 (store (store (select .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_789 .cse2)) .cse3 (select v_ArrVal_789 .cse3))))))))) (or .cse13 (and (forall ((v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse20 (select (store (store .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_794) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_792) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 v_arrayElimCell_56))))) (not (= v_ArrVal_789 (store (store (select .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_789 .cse2)) .cse3 (select v_ArrVal_789 .cse3))))))) (or .cse17 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_788))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_794) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_792) .cse5) .cse6)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (not (= v_ArrVal_789 (store (store (select .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_789 .cse2)) .cse3 (select v_ArrVal_789 .cse3)))))))))))))) is different from false [2023-12-24 21:30:17,695 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse32 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~last~0#1.offset|))) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select .cse31 .cse32)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse7)) (.cse11 (= .cse5 .cse7)) (.cse3 (bvadd |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| (_ bv8 32))) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse31 .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse8 (bvadd (_ bv4 32) .cse15))) (let ((.cse9 (and (or .cse10 (and (forall ((v_arrayElimCell_53 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse25 (select (store (store .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 v_arrayElimCell_56)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 v_arrayElimCell_53)))))))) (or .cse11 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_53 (_ BitVec 32)) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)) v_arrayElimCell_53)))))))) (or .cse11 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_53 (_ BitVec 32)) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (let ((.cse27 (select (store (store .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)))) (or (= (select .cse27 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (store (select .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 v_arrayElimCell_53))))))) (forall ((v_arrayElimCell_53 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse30 (select (store (store .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)))) (or (= (select .cse30 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 v_arrayElimCell_56)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 v_arrayElimCell_53)))))))))) (.cse0 (not .cse11))) (and (or .cse0 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (let ((.cse1 (select (store (store .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)))) (or (= (select .cse1 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (store (select .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 v_arrayElimCell_56))))))) (or (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse7) .cse9) (or (not .cse10) (and (or .cse11 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (= (select (select (store (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)) v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (store (select .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)))))) (forall ((v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse14 (select (store (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_55 (_ BitVec 32))) (= (select .cse14 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 v_arrayElimCell_56)))))))))) (or (= .cse15 |c_ULTIMATE.start_dll_insert_~last~0#1.offset|) .cse9) (or .cse11 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (let ((.cse16 (select (store (store .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)))) (or (= (select .cse16 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (store (select .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))))) (or (and (forall ((v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse19 (select (store (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 v_arrayElimCell_56)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) .cse11)) .cse10) (forall ((v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse22 (select (store (store .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)))) (or (= (select .cse22 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 v_arrayElimCell_56)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))))) (or .cse0 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)) v_arrayElimCell_56))))))))))) is different from false [2023-12-24 21:30:21,716 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse32 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~last~0#1.offset|))) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select .cse31 .cse32)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse7)) (.cse11 (= .cse5 .cse7)) (.cse3 (bvadd |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| (_ bv8 32))) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse31 .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse8 (bvadd (_ bv4 32) .cse15))) (let ((.cse9 (and (or .cse10 (and (forall ((v_arrayElimCell_53 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse25 (select (store (store .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 v_arrayElimCell_56)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 v_arrayElimCell_53)))))))) (or .cse11 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_53 (_ BitVec 32)) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)) v_arrayElimCell_53)))))))) (or .cse11 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_53 (_ BitVec 32)) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (let ((.cse27 (select (store (store .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)))) (or (= (select .cse27 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (store (select .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 v_arrayElimCell_53))))))) (forall ((v_arrayElimCell_53 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse30 (select (store (store .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)))) (or (= (select .cse30 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 v_arrayElimCell_56)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 v_arrayElimCell_53)))))))))) (.cse0 (not .cse11))) (and (or .cse0 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (let ((.cse1 (select (store (store .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)))) (or (= (select .cse1 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (store (select .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 v_arrayElimCell_56))))))) (or (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse7) .cse9) (or (not .cse10) (and (or .cse11 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (= (select (select (store (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)) v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (store (select .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)))))) (forall ((v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse14 (select (store (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_55 (_ BitVec 32))) (= (select .cse14 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 v_arrayElimCell_56)))))))))) (or (= .cse15 |c_ULTIMATE.start_dll_insert_~last~0#1.offset|) .cse9) (or .cse11 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_55 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (let ((.cse16 (select (store (store .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)))) (or (= (select .cse16 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (store (select .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))))) (or (and (forall ((v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse19 (select (store (store .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 v_arrayElimCell_56)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))))) (or (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))))) .cse11)) .cse10) (forall ((v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse22 (select (store (store .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)))) (or (= (select .cse22 v_arrayElimCell_55) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 v_arrayElimCell_56)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))))) (or .cse0 (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_788))) (or (not (= (store (store (select .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse3 (select v_ArrVal_789 .cse3)) .cse4 (select v_ArrVal_789 .cse4)) v_ArrVal_789)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_789) .cse5 v_ArrVal_794) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_790) .cse5 v_ArrVal_792) .cse7) .cse8)) v_arrayElimCell_56))))))))))) is different from true [2023-12-24 21:30:22,299 INFO L349 Elim1Store]: treesize reduction 342, result has 40.1 percent of original size [2023-12-24 21:30:22,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 9990 treesize of output 9682 [2023-12-24 21:30:22,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:22,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1385 treesize of output 1317 [2023-12-24 21:30:22,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:22,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1239 treesize of output 1235 [2023-12-24 21:30:22,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:22,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1027 treesize of output 1019 [2023-12-24 21:30:26,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:26,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 157 treesize of output 161 [2023-12-24 21:30:27,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:27,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1083 treesize of output 1061 [2023-12-24 21:30:27,779 INFO L349 Elim1Store]: treesize reduction 136, result has 51.8 percent of original size [2023-12-24 21:30:27,780 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 5015 treesize of output 4888 [2023-12-24 21:30:27,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:27,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 708 treesize of output 700 [2023-12-24 21:30:27,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 530 treesize of output 524 [2023-12-24 21:30:27,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 513 treesize of output 505 [2023-12-24 21:30:28,671 INFO L349 Elim1Store]: treesize reduction 139, result has 52.1 percent of original size [2023-12-24 21:30:28,671 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 5015 treesize of output 4893 [2023-12-24 21:30:28,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:28,751 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 753 treesize of output 753 [2023-12-24 21:30:28,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 820 treesize of output 810 [2023-12-24 21:30:28,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 513 treesize of output 505 [2023-12-24 21:30:30,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-12-24 21:30:30,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-24 21:30:30,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-12-24 21:30:30,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-12-24 21:30:30,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-12-24 21:30:30,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2023-12-24 21:30:32,259 INFO L349 Elim1Store]: treesize reduction 417, result has 52.4 percent of original size [2023-12-24 21:30:32,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 14965 treesize of output 14623 [2023-12-24 21:30:32,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:32,412 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 2241 treesize of output 2105 [2023-12-24 21:30:32,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:32,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2181 treesize of output 2183 [2023-12-24 21:30:33,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:30:33,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1540 treesize of output 1540 Received shutdown request... [2023-12-24 21:43:58,086 WARN L340 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 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 21:43:58,091 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 21:43:58,214 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 21:43:58,221 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 (12)] Forceful destruction successful, exit code 0 [2023-12-24 21:43:58,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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:43:58,415 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-7-1 term,while PolyPacSimplificationTermWalker was simplifying 7 xjuncts wrt. a ∧-13-5-2-2-3-1 context. [2023-12-24 21:43:58,420 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:43:58,422 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 21:43:58,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:43:58 BoogieIcfgContainer [2023-12-24 21:43:58,429 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 21:43:58,431 INFO L158 Benchmark]: Toolchain (without parser) took 860447.16ms. Allocated memory was 199.2MB in the beginning and 265.3MB in the end (delta: 66.1MB). Free memory was 151.7MB in the beginning and 130.7MB in the end (delta: 21.1MB). Peak memory consumption was 155.6MB. Max. memory is 8.0GB. [2023-12-24 21:43:58,434 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 199.2MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:43:58,434 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.96ms. Allocated memory is still 199.2MB. Free memory was 151.5MB in the beginning and 131.6MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-24 21:43:58,434 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.71ms. Allocated memory is still 199.2MB. Free memory was 131.6MB in the beginning and 129.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 21:43:58,435 INFO L158 Benchmark]: Boogie Preprocessor took 82.10ms. Allocated memory is still 199.2MB. Free memory was 129.1MB in the beginning and 125.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-24 21:43:58,436 INFO L158 Benchmark]: RCFGBuilder took 632.73ms. Allocated memory is still 199.2MB. Free memory was 125.1MB in the beginning and 158.3MB in the end (delta: -33.2MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. [2023-12-24 21:43:58,436 INFO L158 Benchmark]: TraceAbstraction took 859269.69ms. Allocated memory was 199.2MB in the beginning and 265.3MB in the end (delta: 66.1MB). Free memory was 157.7MB in the beginning and 130.7MB in the end (delta: 27.1MB). Peak memory consumption was 160.0MB. Max. memory is 8.0GB. [2023-12-24 21:43:58,438 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.16ms. Allocated memory is still 199.2MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 404.96ms. Allocated memory is still 199.2MB. Free memory was 151.5MB in the beginning and 131.6MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.71ms. Allocated memory is still 199.2MB. Free memory was 131.6MB in the beginning and 129.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 82.10ms. Allocated memory is still 199.2MB. Free memory was 129.1MB in the beginning and 125.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 632.73ms. Allocated memory is still 199.2MB. Free memory was 125.1MB in the beginning and 158.3MB in the end (delta: -33.2MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. * TraceAbstraction took 859269.69ms. Allocated memory was 199.2MB in the beginning and 265.3MB in the end (delta: 66.1MB). Free memory was 157.7MB in the beginning and 130.7MB in the end (delta: 27.1MB). Peak memory consumption was 160.0MB. Max. memory is 8.0GB. * 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 - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 669). Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-7-1 term,while PolyPacSimplificationTermWalker was simplifying 7 xjuncts wrt. a ∧-13-5-2-2-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 859.2s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 283 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 283 mSDsluCounter, 961 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 330 IncrementalHoareTripleChecker+Unchecked, 701 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 821 IncrementalHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 260 mSDtfsCounter, 821 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 240 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=8, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 43 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 298 ConstructedInterpolants, 17 QuantifiedInterpolants, 2416 SizeOfPredicates, 56 NumberOfNonLiveVariables, 1832 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 69/90 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: Timeout Completed graceful shutdown