/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/heap-manipulation/bubble_sort_linux-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 20:42:37,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 20:42:37,352 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 20:42:37,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 20:42:37,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 20:42:37,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 20:42:37,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 20:42:37,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 20:42:37,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 20:42:37,371 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 20:42:37,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 20:42:37,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 20:42:37,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 20:42:37,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 20:42:37,372 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 20:42:37,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 20:42:37,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 20:42:37,373 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 20:42:37,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 20:42:37,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 20:42:37,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 20:42:37,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 20:42:37,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 20:42:37,377 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 20:42:37,380 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 20:42:37,380 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 20:42:37,380 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 20:42:37,380 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 20:42:37,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 20:42:37,381 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 20:42:37,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 20:42:37,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 20:42:37,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 20:42:37,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 20:42:37,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:42:37,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 20:42:37,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 20:42:37,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 20:42:37,383 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 20:42:37,383 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 20:42:37,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 20:42:37,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 20:42:37,383 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 20:42:37,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 20:42:37,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 20:42:37,384 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 20:42:37,384 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 20:42:37,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 20:42:37,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 20:42:37,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 20:42:37,592 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 20:42:37,593 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 20:42:37,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i [2023-12-24 20:42:38,549 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 20:42:38,746 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 20:42:38,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i [2023-12-24 20:42:38,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7182002d4/72766dd58985473ab6a2e17705cd29a0/FLAGb890f745a [2023-12-24 20:42:38,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7182002d4/72766dd58985473ab6a2e17705cd29a0 [2023-12-24 20:42:38,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 20:42:38,771 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 20:42:38,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 20:42:38,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 20:42:38,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 20:42:38,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:42:38" (1/1) ... [2023-12-24 20:42:38,777 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f6ab03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:42:38, skipping insertion in model container [2023-12-24 20:42:38,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:42:38" (1/1) ... [2023-12-24 20:42:38,821 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 20:42:39,112 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2023-12-24 20:42:39,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:42:39,164 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-24 20:42:39,169 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 20:42:39,194 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2023-12-24 20:42:39,203 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:42:39,210 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 20:42:39,241 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2023-12-24 20:42:39,250 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:42:39,285 INFO L206 MainTranslator]: Completed translation [2023-12-24 20:42:39,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:42:39 WrapperNode [2023-12-24 20:42:39,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 20:42:39,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 20:42:39,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 20:42:39,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 20:42:39,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:42:39" (1/1) ... [2023-12-24 20:42:39,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:42:39" (1/1) ... [2023-12-24 20:42:39,317 INFO L138 Inliner]: procedures = 235, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 115 [2023-12-24 20:42:39,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 20:42:39,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 20:42:39,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 20:42:39,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 20:42:39,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:42:39" (1/1) ... [2023-12-24 20:42:39,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:42:39" (1/1) ... [2023-12-24 20:42:39,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:42:39" (1/1) ... [2023-12-24 20:42:39,360 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2023-12-24 20:42:39,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:42:39" (1/1) ... [2023-12-24 20:42:39,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:42:39" (1/1) ... [2023-12-24 20:42:39,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:42:39" (1/1) ... [2023-12-24 20:42:39,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:42:39" (1/1) ... [2023-12-24 20:42:39,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:42:39" (1/1) ... [2023-12-24 20:42:39,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:42:39" (1/1) ... [2023-12-24 20:42:39,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 20:42:39,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 20:42:39,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 20:42:39,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 20:42:39,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:42:39" (1/1) ... [2023-12-24 20:42:39,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:42:39,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 20:42:39,437 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 20:42:39,457 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 20:42:39,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 20:42:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 20:42:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 20:42:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 20:42:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-12-24 20:42:39,471 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-12-24 20:42:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 20:42:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 20:42:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 20:42:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-24 20:42:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-24 20:42:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 20:42:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 20:42:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-12-24 20:42:39,472 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-12-24 20:42:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-12-24 20:42:39,473 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-12-24 20:42:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 20:42:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 20:42:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 20:42:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 20:42:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-12-24 20:42:39,475 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-12-24 20:42:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 20:42:39,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 20:42:39,604 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 20:42:39,605 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 20:42:40,007 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 20:42:40,056 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 20:42:40,056 INFO L309 CfgBuilder]: Removed 41 assume(true) statements. [2023-12-24 20:42:40,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:42:40 BoogieIcfgContainer [2023-12-24 20:42:40,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 20:42:40,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 20:42:40,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 20:42:40,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 20:42:40,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 08:42:38" (1/3) ... [2023-12-24 20:42:40,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72daffce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:42:40, skipping insertion in model container [2023-12-24 20:42:40,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:42:39" (2/3) ... [2023-12-24 20:42:40,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72daffce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:42:40, skipping insertion in model container [2023-12-24 20:42:40,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:42:40" (3/3) ... [2023-12-24 20:42:40,062 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2023-12-24 20:42:40,076 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 20:42:40,077 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 20:42:40,124 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 20:42:40,131 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;@4bf5c42a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 20:42:40,131 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 20:42:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-24 20:42:40,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-24 20:42:40,142 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:42:40,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:42:40,143 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:42:40,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:42:40,149 INFO L85 PathProgramCache]: Analyzing trace with hash -754496073, now seen corresponding path program 1 times [2023-12-24 20:42:40,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:42:40,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366666893] [2023-12-24 20:42:40,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:42:40,158 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 20:42:40,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:42:40,160 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 20:42:40,165 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 20:42:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:42:40,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 20:42:40,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:42:40,243 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 20:42:40,243 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:42:40,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:42:40,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366666893] [2023-12-24 20:42:40,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366666893] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:42:40,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:42:40,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 20:42:40,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641387712] [2023-12-24 20:42:40,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:42:40,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 20:42:40,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:42:40,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 20:42:40,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 20:42:40,268 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 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 20:42:40,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:42:40,423 INFO L93 Difference]: Finished difference Result 210 states and 377 transitions. [2023-12-24 20:42:40,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 20:42:40,426 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 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) Word has length 8 [2023-12-24 20:42:40,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:42:40,433 INFO L225 Difference]: With dead ends: 210 [2023-12-24 20:42:40,433 INFO L226 Difference]: Without dead ends: 99 [2023-12-24 20:42:40,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 20:42:40,444 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:42:40,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 20:42:40,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-24 20:42:40,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-12-24 20:42:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 20:42:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2023-12-24 20:42:40,482 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 8 [2023-12-24 20:42:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:42:40,482 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2023-12-24 20:42:40,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 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 20:42:40,482 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2023-12-24 20:42:40,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-24 20:42:40,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:42:40,483 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 20:42:40,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 20:42:40,684 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 20:42:40,685 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:42:40,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:42:40,685 INFO L85 PathProgramCache]: Analyzing trace with hash 437181209, now seen corresponding path program 1 times [2023-12-24 20:42:40,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:42:40,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366622817] [2023-12-24 20:42:40,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:42:40,686 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 20:42:40,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:42:40,690 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 20:42:40,693 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 20:42:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:42:40,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 20:42:40,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:42:40,871 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 20:42:40,871 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:42:40,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:42:40,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366622817] [2023-12-24 20:42:40,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366622817] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:42:40,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:42:40,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 20:42:40,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620332283] [2023-12-24 20:42:40,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:42:40,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 20:42:40,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:42:40,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 20:42:40,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 20:42:40,879 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:42:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:42:41,139 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2023-12-24 20:42:41,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 20:42:41,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-12-24 20:42:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:42:41,143 INFO L225 Difference]: With dead ends: 101 [2023-12-24 20:42:41,143 INFO L226 Difference]: Without dead ends: 98 [2023-12-24 20:42:41,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 20:42:41,144 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 166 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 20:42:41,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 208 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 20:42:41,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-24 20:42:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-12-24 20:42:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 20:42:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2023-12-24 20:42:41,166 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 17 [2023-12-24 20:42:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:42:41,167 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2023-12-24 20:42:41,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:42:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2023-12-24 20:42:41,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-24 20:42:41,170 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:42:41,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:42:41,177 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 (3)] Ended with exit code 0 [2023-12-24 20:42:41,379 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 20:42:41,380 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:42:41,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:42:41,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1443607003, now seen corresponding path program 1 times [2023-12-24 20:42:41,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:42:41,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215598650] [2023-12-24 20:42:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:42:41,381 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 20:42:41,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:42:41,384 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 20:42:41,388 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 20:42:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:42:41,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 20:42:41,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:42:41,561 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:42:41,562 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 13 treesize of output 13 [2023-12-24 20:42:41,847 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-12-24 20:42:41,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 269 [2023-12-24 20:42:41,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 140 [2023-12-24 20:42:41,901 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 8 treesize of output 7 [2023-12-24 20:42:41,979 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 8 treesize of output 7 [2023-12-24 20:42:42,053 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 8 treesize of output 7 [2023-12-24 20:42:42,192 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:42:42,198 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:42:42,200 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:42:42,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 60 [2023-12-24 20:42:42,217 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 20:42:42,252 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:42:42,257 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:42:42,276 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-12-24 20:42:42,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 109 [2023-12-24 20:42:42,332 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 20:42:42,411 INFO L349 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2023-12-24 20:42:42,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 113 [2023-12-24 20:42:42,628 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse0 (= |c_list_add_#in~new#1.base| |c_list_add_#in~head#1.base|)) (.cse4 (= |c_list_add_#in~new#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|)))) (or (and .cse0 (or (exists ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_4 (_ BitVec 32)) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_4))) (let ((.cse2 (store (store (store |c_#memory_$Pointer$#1.base| v_arrayElimCell_4 v_DerPreprocessor_10) |c_list_add_#in~new#1.base| v_DerPreprocessor_11) |c_list_add_#in~head#1.base| (store .cse3 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))) (let ((.cse1 (select .cse2 v_arrayElimCell_4))) (and (= .cse1 v_DerPreprocessor_10) (= v_DerPreprocessor_11 (select .cse2 |c_list_add_#in~new#1.base|)) (= .cse1 .cse3)))))) (exists ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |c_list_add_#in~new#1.base| (select v_DerPreprocessor_12 |c_list_add_#in~head#1.offset|)) (= (select (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base| v_DerPreprocessor_11) |c_list_add_#in~head#1.base| v_DerPreprocessor_12) |c_list_add_#in~new#1.base|) v_DerPreprocessor_11)))) .cse4) (and (not .cse0) .cse4))) (= (_ bv3 32) |c_~#gl_list~0.base|)) is different from true [2023-12-24 20:42:42,664 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 20:42:42,664 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 25 treesize of output 26 [2023-12-24 20:42:42,723 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 20:42:42,735 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 20:42:42,735 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:42:42,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:42:42,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215598650] [2023-12-24 20:42:42,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215598650] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:42:42,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:42:42,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 20:42:42,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668387592] [2023-12-24 20:42:42,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:42:42,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 20:42:42,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:42:42,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 20:42:42,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=1, NotChecked=16, Total=110 [2023-12-24 20:42:42,742 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:42:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:42:43,907 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2023-12-24 20:42:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 20:42:43,908 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-12-24 20:42:43,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:42:43,913 INFO L225 Difference]: With dead ends: 187 [2023-12-24 20:42:43,913 INFO L226 Difference]: Without dead ends: 181 [2023-12-24 20:42:43,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=225, Unknown=1, NotChecked=32, Total=342 [2023-12-24 20:42:43,915 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 427 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 20:42:43,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 439 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 386 Invalid, 0 Unknown, 219 Unchecked, 1.0s Time] [2023-12-24 20:42:43,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-24 20:42:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2023-12-24 20:42:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 133 states have (on average 1.263157894736842) internal successors, (168), 147 states have internal predecessors, (168), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-24 20:42:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 198 transitions. [2023-12-24 20:42:43,944 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 198 transitions. Word has length 20 [2023-12-24 20:42:43,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:42:43,945 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 198 transitions. [2023-12-24 20:42:43,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:42:43,945 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 198 transitions. [2023-12-24 20:42:43,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 20:42:43,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:42:43,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:42:43,952 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 20:42:44,150 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 20:42:44,150 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:42:44,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:42:44,152 INFO L85 PathProgramCache]: Analyzing trace with hash 722118342, now seen corresponding path program 1 times [2023-12-24 20:42:44,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:42:44,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130538093] [2023-12-24 20:42:44,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:42:44,153 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 20:42:44,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:42:44,154 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 20:42:44,172 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 20:42:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:42:44,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-24 20:42:44,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:42:44,331 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:42:44,331 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 13 treesize of output 13 [2023-12-24 20:42:44,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:42:44,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:42:44,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-12-24 20:42:44,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2023-12-24 20:42:44,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:42:44,525 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 25 treesize of output 14 [2023-12-24 20:42:44,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 24 treesize of output 15 [2023-12-24 20:42:44,649 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 20:42:44,669 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 20:42:44,669 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:42:44,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:42:44,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130538093] [2023-12-24 20:42:44,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130538093] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:42:44,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:42:44,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 20:42:44,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016455135] [2023-12-24 20:42:44,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:42:44,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 20:42:44,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:42:44,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 20:42:44,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=87, Unknown=3, NotChecked=0, Total=110 [2023-12-24 20:42:44,671 INFO L87 Difference]: Start difference. First operand 161 states and 198 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:42:47,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:42:49,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:42:49,784 INFO L93 Difference]: Finished difference Result 260 states and 314 transitions. [2023-12-24 20:42:49,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 20:42:49,784 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-12-24 20:42:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:42:49,785 INFO L225 Difference]: With dead ends: 260 [2023-12-24 20:42:49,785 INFO L226 Difference]: Without dead ends: 257 [2023-12-24 20:42:49,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=208, Unknown=8, NotChecked=0, Total=272 [2023-12-24 20:42:49,787 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 218 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 33 mSolverCounterUnsat, 112 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 112 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-24 20:42:49,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 310 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 864 Invalid, 112 Unknown, 0 Unchecked, 4.9s Time] [2023-12-24 20:42:49,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-12-24 20:42:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 240. [2023-12-24 20:42:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2549019607843137) internal successors, (256), 219 states have internal predecessors, (256), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 20:42:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 295 transitions. [2023-12-24 20:42:49,811 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 295 transitions. Word has length 23 [2023-12-24 20:42:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:42:49,811 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 295 transitions. [2023-12-24 20:42:49,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:42:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 295 transitions. [2023-12-24 20:42:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-24 20:42:49,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:42:49,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:42:49,819 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 20:42:50,016 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 20:42:50,017 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:42:50,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:42:50,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1115915285, now seen corresponding path program 1 times [2023-12-24 20:42:50,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:42:50,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590957883] [2023-12-24 20:42:50,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:42:50,018 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 20:42:50,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:42:50,019 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 20:42:50,052 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 20:42:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:42:50,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-24 20:42:50,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:42:50,179 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:42:50,180 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 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 20:42:50,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:42:50,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:42:50,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-12-24 20:42:50,337 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2023-12-24 20:42:50,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:42:50,406 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 25 treesize of output 14 [2023-12-24 20:42:50,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 30 treesize of output 19 [2023-12-24 20:42:50,671 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 24 treesize of output 12 [2023-12-24 20:42:50,707 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 20:42:50,708 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:42:50,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:42:50,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590957883] [2023-12-24 20:42:50,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590957883] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:42:50,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:42:50,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 20:42:50,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728490149] [2023-12-24 20:42:50,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:42:50,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 20:42:50,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:42:50,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 20:42:50,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=89, Unknown=1, NotChecked=0, Total=110 [2023-12-24 20:42:50,709 INFO L87 Difference]: Start difference. First operand 240 states and 295 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:42:52,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:42:57,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:42:58,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:43:05,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:43:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:43:05,822 INFO L93 Difference]: Finished difference Result 259 states and 312 transitions. [2023-12-24 20:43:05,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 20:43:05,823 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-12-24 20:43:05,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:43:05,824 INFO L225 Difference]: With dead ends: 259 [2023-12-24 20:43:05,824 INFO L226 Difference]: Without dead ends: 256 [2023-12-24 20:43:05,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=212, Unknown=6, NotChecked=0, Total=272 [2023-12-24 20:43:05,825 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 257 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 31 mSolverCounterUnsat, 83 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 83 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2023-12-24 20:43:05,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 362 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 838 Invalid, 83 Unknown, 0 Unchecked, 14.8s Time] [2023-12-24 20:43:05,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-12-24 20:43:05,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 240. [2023-12-24 20:43:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.25) internal successors, (255), 219 states have internal predecessors, (255), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 20:43:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 294 transitions. [2023-12-24 20:43:05,853 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 294 transitions. Word has length 26 [2023-12-24 20:43:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:43:05,853 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 294 transitions. [2023-12-24 20:43:05,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:43:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 294 transitions. [2023-12-24 20:43:05,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-24 20:43:05,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:43:05,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:43:05,861 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 (6)] Ended with exit code 0 [2023-12-24 20:43:06,059 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 20:43:06,059 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:43:06,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:43:06,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1422251983, now seen corresponding path program 1 times [2023-12-24 20:43:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:43:06,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282151643] [2023-12-24 20:43:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:43:06,060 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 20:43:06,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:43:06,061 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 20:43:06,063 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 20:43:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:43:06,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-24 20:43:06,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:43:06,355 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:43:06,355 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 13 treesize of output 13 [2023-12-24 20:43:06,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:43:06,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:43:07,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-12-24 20:43:07,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 18 [2023-12-24 20:43:07,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2023-12-24 20:43:07,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2023-12-24 20:43:07,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 15 [2023-12-24 20:43:07,396 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2023-12-24 20:43:07,613 INFO L349 Elim1Store]: treesize reduction 32, result has 13.5 percent of original size [2023-12-24 20:43:07,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 99 [2023-12-24 20:43:07,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 23 treesize of output 14 [2023-12-24 20:43:07,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:07,637 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 25 treesize of output 14 [2023-12-24 20:43:07,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 23 [2023-12-24 20:43:07,659 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2023-12-24 20:43:08,170 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 30 treesize of output 18 [2023-12-24 20:43:08,409 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 20:43:08,409 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:43:08,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:43:08,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282151643] [2023-12-24 20:43:08,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282151643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:43:08,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:43:08,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-24 20:43:08,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873342880] [2023-12-24 20:43:08,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:43:08,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 20:43:08,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:43:08,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 20:43:08,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-12-24 20:43:08,410 INFO L87 Difference]: Start difference. First operand 240 states and 294 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:43:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:43:15,536 INFO L93 Difference]: Finished difference Result 258 states and 310 transitions. [2023-12-24 20:43:15,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 20:43:15,537 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2023-12-24 20:43:15,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:43:15,538 INFO L225 Difference]: With dead ends: 258 [2023-12-24 20:43:15,538 INFO L226 Difference]: Without dead ends: 255 [2023-12-24 20:43:15,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-12-24 20:43:15,539 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 250 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 28 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-12-24 20:43:15,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 385 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 937 Invalid, 5 Unknown, 0 Unchecked, 6.5s Time] [2023-12-24 20:43:15,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-12-24 20:43:15,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 240. [2023-12-24 20:43:15,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2450980392156863) internal successors, (254), 219 states have internal predecessors, (254), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 20:43:15,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 293 transitions. [2023-12-24 20:43:15,562 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 293 transitions. Word has length 29 [2023-12-24 20:43:15,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:43:15,562 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 293 transitions. [2023-12-24 20:43:15,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:43:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 293 transitions. [2023-12-24 20:43:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-24 20:43:15,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:43:15,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:43:15,568 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 (7)] Ended with exit code 0 [2023-12-24 20:43:15,767 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 20:43:15,768 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:43:15,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:43:15,768 INFO L85 PathProgramCache]: Analyzing trace with hash -678942440, now seen corresponding path program 1 times [2023-12-24 20:43:15,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:43:15,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423317009] [2023-12-24 20:43:15,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:43:15,769 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 20:43:15,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:43:15,770 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 20:43:15,771 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 20:43:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:43:15,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-24 20:43:15,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:43:15,981 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:43:15,981 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 13 treesize of output 13 [2023-12-24 20:43:16,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:43:16,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:43:17,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2023-12-24 20:43:17,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2023-12-24 20:43:17,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 26 [2023-12-24 20:43:17,547 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2023-12-24 20:43:17,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-12-24 20:43:17,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2023-12-24 20:43:17,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:17,815 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2023-12-24 20:43:17,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 23 treesize of output 14 [2023-12-24 20:43:17,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:17,833 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 25 treesize of output 14 [2023-12-24 20:43:17,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 23 [2023-12-24 20:43:17,852 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2023-12-24 20:43:18,441 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 38 treesize of output 22 [2023-12-24 20:43:18,729 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 20:43:18,729 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:43:18,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:43:18,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423317009] [2023-12-24 20:43:18,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423317009] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:43:18,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:43:18,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-24 20:43:18,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753788127] [2023-12-24 20:43:18,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:43:18,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 20:43:18,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:43:18,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 20:43:18,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-12-24 20:43:18,731 INFO L87 Difference]: Start difference. First operand 240 states and 293 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:43:25,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:43:25,895 INFO L93 Difference]: Finished difference Result 257 states and 308 transitions. [2023-12-24 20:43:25,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 20:43:25,896 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2023-12-24 20:43:25,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:43:25,897 INFO L225 Difference]: With dead ends: 257 [2023-12-24 20:43:25,897 INFO L226 Difference]: Without dead ends: 254 [2023-12-24 20:43:25,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2023-12-24 20:43:25,898 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 244 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-12-24 20:43:25,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 405 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 925 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2023-12-24 20:43:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-24 20:43:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2023-12-24 20:43:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2401960784313726) internal successors, (253), 219 states have internal predecessors, (253), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 20:43:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 292 transitions. [2023-12-24 20:43:25,951 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 292 transitions. Word has length 32 [2023-12-24 20:43:25,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:43:25,952 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 292 transitions. [2023-12-24 20:43:25,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:43:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 292 transitions. [2023-12-24 20:43:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-24 20:43:25,953 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:43:25,953 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:43:25,958 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 (8)] Ended with exit code 0 [2023-12-24 20:43:26,153 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 20:43:26,153 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:43:26,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:43:26,154 INFO L85 PathProgramCache]: Analyzing trace with hash -58033664, now seen corresponding path program 1 times [2023-12-24 20:43:26,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:43:26,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829319372] [2023-12-24 20:43:26,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:43:26,154 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 20:43:26,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:43:26,177 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 20:43:26,204 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 20:43:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:43:26,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-24 20:43:26,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:43:26,481 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 20:43:26,481 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 20:43:26,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:43:26,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:43:27,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-12-24 20:43:27,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:27,067 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 36 treesize of output 19 [2023-12-24 20:43:27,073 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-12-24 20:43:27,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:27,093 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 22 treesize of output 14 [2023-12-24 20:43:27,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-12-24 20:43:27,223 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 20:43:27,224 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 20:43:27,230 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 20:43:27,514 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2023-12-24 20:43:27,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2023-12-24 20:43:27,624 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 25 treesize of output 18 [2023-12-24 20:43:27,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:43:28,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 68 [2023-12-24 20:43:28,140 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 148 treesize of output 116 [2023-12-24 20:43:28,146 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 38 treesize of output 1 [2023-12-24 20:43:28,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:28,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:28,565 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 26 treesize of output 19 [2023-12-24 20:43:28,569 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-12-24 20:43:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 20:43:29,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:43:30,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:43:30,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829319372] [2023-12-24 20:43:30,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829319372] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:43:30,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [64508134] [2023-12-24 20:43:30,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:43:30,028 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:43:30,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:43:30,066 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:43:30,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-24 20:43:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:43:30,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-24 20:43:30,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:43:30,798 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 20:43:30,798 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 20:43:30,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:43:30,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:43:32,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-24 20:43:32,891 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 0 case distinctions, treesize of input 45 treesize of output 47 [2023-12-24 20:43:32,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:32,925 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 22 treesize of output 14 [2023-12-24 20:43:32,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-12-24 20:43:33,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:33,276 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 29 treesize of output 14 [2023-12-24 20:43:33,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 23 treesize of output 14 [2023-12-24 20:43:33,301 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-24 20:43:33,301 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 36 treesize of output 35 [2023-12-24 20:43:33,490 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2023-12-24 20:43:33,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2023-12-24 20:43:33,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:43:33,561 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 25 treesize of output 18 [2023-12-24 20:43:33,692 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse6 (select (select |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (let ((.cse2 (= .cse6 |c_list_add_#in~head#1.base|))) (let ((.cse4 (store |c_old(#memory_$Pointer$#1.offset)| .cse6 (select |c_#memory_$Pointer$#1.offset| .cse6))) (.cse9 (not .cse2)) (.cse7 (select |c_old(#memory_$Pointer$#1.offset)| .cse6)) (.cse8 (bvadd (_ bv4 32) (select (select |c_old(#memory_$Pointer$#1.offset)| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (.cse0 (= |c_list_add_#in~new#1.base| |c_list_add_#in~head#1.base|))) (or (and (not .cse0) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_list_add_#in~new#1.base|))) (let ((.cse1 (exists ((v_ArrVal_580 (_ BitVec 32)) (v_ArrVal_578 (_ BitVec 32))) (= (store (store |c_old(#memory_$Pointer$#1.offset)| |c_list_add_#in~new#1.base| .cse5) |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$#1.offset)| .cse6 (store .cse7 .cse8 v_ArrVal_580)) |c_list_add_#in~new#1.base| .cse5) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| v_ArrVal_578)) |c_#memory_$Pointer$#1.offset|))) (.cse3 (= |c_list_add_#in~new#1.base| .cse6))) (or (and .cse1 .cse2) (and .cse3 .cse1) (and (exists ((v_ArrVal_580 (_ BitVec 32)) (v_ArrVal_578 (_ BitVec 32))) (= (store (store .cse4 |c_list_add_#in~new#1.base| .cse5) |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$#1.offset)| .cse6 (store .cse7 .cse8 v_ArrVal_580)) |c_list_add_#in~new#1.base| .cse5) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| v_ArrVal_578)) |c_#memory_$Pointer$#1.offset|)) (not .cse3) .cse9))))) (and (or (and (exists ((v_ArrVal_580 (_ BitVec 32)) (v_ArrVal_578 (_ BitVec 32)) (v_ArrVal_579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store .cse4 |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$#1.offset)| .cse6 (store .cse7 .cse8 v_ArrVal_580)) |c_list_add_#in~new#1.base| v_ArrVal_579) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| v_ArrVal_578)) |c_#memory_$Pointer$#1.offset|)) .cse9) (and .cse2 (exists ((v_ArrVal_580 (_ BitVec 32)) (v_ArrVal_578 (_ BitVec 32)) (v_ArrVal_579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$#1.offset)| .cse6 (store .cse7 .cse8 v_ArrVal_580)) |c_list_add_#in~new#1.base| v_ArrVal_579) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| v_ArrVal_578)))))) .cse0))))) (= (_ bv3 32) |c_~#gl_list~0.base|) (= |c_~#gl_list~0.offset| (_ bv0 32))) is different from true [2023-12-24 20:43:33,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 68 [2023-12-24 20:43:33,732 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 148 treesize of output 116 [2023-12-24 20:43:33,740 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 38 treesize of output 1 [2023-12-24 20:43:40,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:40,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:43:40,736 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 26 treesize of output 19 [2023-12-24 20:43:40,742 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-12-24 20:43:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-24 20:43:40,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:43:40,922 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_582) |c_~#gl_list~0.base|) (bvadd (_ bv4 32) |c_~#gl_list~0.offset|)) |c_~#gl_list~0.offset|))) is different from false [2023-12-24 20:43:41,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [64508134] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:43:41,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:43:41,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2023-12-24 20:43:41,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615032784] [2023-12-24 20:43:41,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:43:41,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-24 20:43:41,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:43:41,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-24 20:43:41,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=531, Unknown=35, NotChecked=98, Total=756 [2023-12-24 20:43:41,447 INFO L87 Difference]: Start difference. First operand 240 states and 292 transitions. Second operand has 20 states, 16 states have (on average 1.9375) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 20:43:45,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:43:49,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:43:57,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:44:01,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:44:27,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:44:36,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:44:40,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 20:44:43,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:44:43,304 INFO L93 Difference]: Finished difference Result 354 states and 421 transitions. [2023-12-24 20:44:43,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-24 20:44:43,304 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.9375) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-12-24 20:44:43,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:44:43,306 INFO L225 Difference]: With dead ends: 354 [2023-12-24 20:44:43,306 INFO L226 Difference]: Without dead ends: 351 [2023-12-24 20:44:43,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=241, Invalid=1195, Unknown=54, NotChecked=150, Total=1640 [2023-12-24 20:44:43,307 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 624 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 95 mSolverCounterUnsat, 211 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 2179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 211 IncrementalHoareTripleChecker+Unknown, 336 IncrementalHoareTripleChecker+Unchecked, 51.9s IncrementalHoareTripleChecker+Time [2023-12-24 20:44:43,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 366 Invalid, 2179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1537 Invalid, 211 Unknown, 336 Unchecked, 51.9s Time] [2023-12-24 20:44:43,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-12-24 20:44:43,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 319. [2023-12-24 20:44:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 275 states have (on average 1.24) internal successors, (341), 291 states have internal predecessors, (341), 33 states have call successors, (33), 12 states have call predecessors, (33), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 20:44:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 389 transitions. [2023-12-24 20:44:43,357 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 389 transitions. Word has length 33 [2023-12-24 20:44:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:44:43,357 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 389 transitions. [2023-12-24 20:44:43,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.9375) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 20:44:43,357 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 389 transitions. [2023-12-24 20:44:43,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-24 20:44:43,359 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:44:43,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:44:43,379 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 (9)] Forceful destruction successful, exit code 0 [2023-12-24 20:44:43,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2023-12-24 20:44:43,765 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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 20:44:43,765 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:44:43,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:44:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1581408063, now seen corresponding path program 1 times [2023-12-24 20:44:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:44:43,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195750991] [2023-12-24 20:44:43,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:44:43,766 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 20:44:43,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:44:43,767 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 20:44:43,769 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 20:44:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:44:43,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-24 20:44:43,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:44:44,029 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:44:44,030 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 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 20:44:44,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:44:44,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:44:44,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-12-24 20:44:44,352 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2023-12-24 20:44:44,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:44,483 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 25 treesize of output 14 [2023-12-24 20:44:44,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 30 treesize of output 19 [2023-12-24 20:44:44,863 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 24 treesize of output 12 [2023-12-24 20:44:45,028 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 20:44:45,028 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:44:45,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:44:45,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195750991] [2023-12-24 20:44:45,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195750991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:44:45,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:44:45,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-24 20:44:45,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449175933] [2023-12-24 20:44:45,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:44:45,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 20:44:45,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:44:45,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 20:44:45,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=109, Unknown=1, NotChecked=0, Total=132 [2023-12-24 20:44:45,031 INFO L87 Difference]: Start difference. First operand 319 states and 389 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:44:50,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:44:50,463 INFO L93 Difference]: Finished difference Result 332 states and 400 transitions. [2023-12-24 20:44:50,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 20:44:50,467 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2023-12-24 20:44:50,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:44:50,468 INFO L225 Difference]: With dead ends: 332 [2023-12-24 20:44:50,468 INFO L226 Difference]: Without dead ends: 329 [2023-12-24 20:44:50,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=297, Unknown=8, NotChecked=0, Total=380 [2023-12-24 20:44:50,469 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 281 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 26 mSolverCounterUnsat, 77 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 77 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-24 20:44:50,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 435 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 864 Invalid, 77 Unknown, 0 Unchecked, 4.8s Time] [2023-12-24 20:44:50,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-12-24 20:44:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 319. [2023-12-24 20:44:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 275 states have (on average 1.2363636363636363) internal successors, (340), 291 states have internal predecessors, (340), 33 states have call successors, (33), 12 states have call predecessors, (33), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 20:44:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 388 transitions. [2023-12-24 20:44:50,519 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 388 transitions. Word has length 35 [2023-12-24 20:44:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:44:50,520 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 388 transitions. [2023-12-24 20:44:50,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 20:44:50,520 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 388 transitions. [2023-12-24 20:44:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-24 20:44:50,521 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:44:50,521 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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 20:44:50,528 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 (11)] Ended with exit code 0 [2023-12-24 20:44:50,728 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 20:44:50,729 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:44:50,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:44:50,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1738679921, now seen corresponding path program 1 times [2023-12-24 20:44:50,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:44:50,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404129273] [2023-12-24 20:44:50,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:44:50,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 20:44:50,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:44:50,731 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 20:44:50,734 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 20:44:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:44:50,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-24 20:44:50,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:44:51,063 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-24 20:44:51,063 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 21 treesize of output 20 [2023-12-24 20:44:51,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:44:51,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:44:51,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-24 20:44:51,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 18 [2023-12-24 20:44:52,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-12-24 20:44:52,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:52,023 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 36 treesize of output 19 [2023-12-24 20:44:52,028 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-12-24 20:44:52,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:52,152 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 23 treesize of output 14 [2023-12-24 20:44:52,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 30 [2023-12-24 20:44:52,163 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 20:44:52,386 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:44:52,386 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 13 treesize of output 13 [2023-12-24 20:44:52,521 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 28 treesize of output 19 [2023-12-24 20:44:52,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-24 20:44:53,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:53,010 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2023-12-24 20:44:53,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:53,018 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 26 treesize of output 23 [2023-12-24 20:44:53,023 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-12-24 20:44:53,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:44:53,120 INFO L349 Elim1Store]: treesize reduction 66, result has 22.4 percent of original size [2023-12-24 20:44:53,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 113 [2023-12-24 20:44:53,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 94 treesize of output 78 [2023-12-24 20:44:53,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:44:53,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404129273] [2023-12-24 20:44:53,222 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-24 20:44:53,227 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 20:44:53,423 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 20:44:53,423 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-24 20:44:53,427 INFO L158 Benchmark]: Toolchain (without parser) took 134656.05ms. Allocated memory was 191.9MB in the beginning and 348.1MB in the end (delta: 156.2MB). Free memory was 153.0MB in the beginning and 184.1MB in the end (delta: -31.2MB). Peak memory consumption was 125.5MB. Max. memory is 8.0GB. [2023-12-24 20:44:53,427 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory was 147.6MB in the beginning and 147.6MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 20:44:53,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.01ms. Allocated memory is still 191.9MB. Free memory was 153.0MB in the beginning and 117.3MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-24 20:44:53,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.41ms. Allocated memory is still 191.9MB. Free memory was 117.3MB in the beginning and 114.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 20:44:53,427 INFO L158 Benchmark]: Boogie Preprocessor took 71.75ms. Allocated memory is still 191.9MB. Free memory was 114.8MB in the beginning and 109.6MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-24 20:44:53,428 INFO L158 Benchmark]: RCFGBuilder took 667.10ms. Allocated memory was 191.9MB in the beginning and 289.4MB in the end (delta: 97.5MB). Free memory was 109.6MB in the beginning and 243.6MB in the end (delta: -134.0MB). Peak memory consumption was 23.6MB. Max. memory is 8.0GB. [2023-12-24 20:44:53,428 INFO L158 Benchmark]: TraceAbstraction took 133368.45ms. Allocated memory was 289.4MB in the beginning and 348.1MB in the end (delta: 58.7MB). Free memory was 243.1MB in the beginning and 184.1MB in the end (delta: 58.9MB). Peak memory consumption was 117.6MB. Max. memory is 8.0GB. [2023-12-24 20:44:53,429 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.11ms. Allocated memory is still 191.9MB. Free memory was 147.6MB in the beginning and 147.6MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 513.01ms. Allocated memory is still 191.9MB. Free memory was 153.0MB in the beginning and 117.3MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.41ms. Allocated memory is still 191.9MB. Free memory was 117.3MB in the beginning and 114.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 71.75ms. Allocated memory is still 191.9MB. Free memory was 114.8MB in the beginning and 109.6MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 667.10ms. Allocated memory was 191.9MB in the beginning and 289.4MB in the end (delta: 97.5MB). Free memory was 109.6MB in the beginning and 243.6MB in the end (delta: -134.0MB). Peak memory consumption was 23.6MB. Max. memory is 8.0GB. * TraceAbstraction took 133368.45ms. Allocated memory was 289.4MB in the beginning and 348.1MB in the end (delta: 58.7MB). Free memory was 243.1MB in the beginning and 184.1MB in the end (delta: 58.9MB). Peak memory consumption was 117.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-12-24 20:44:53,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...