/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_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 17:00:42,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 17:00:42,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 17:00:42,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 17:00:42,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 17:00:42,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 17:00:42,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 17:00:42,356 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 17:00:42,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 17:00:42,359 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 17:00:42,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 17:00:42,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 17:00:42,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 17:00:42,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 17:00:42,361 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 17:00:42,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 17:00:42,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 17:00:42,362 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 17:00:42,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 17:00:42,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 17:00:42,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 17:00:42,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 17:00:42,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 17:00:42,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 17:00:42,363 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 17:00:42,363 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 17:00:42,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 17:00:42,363 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 17:00:42,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 17:00:42,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 17:00:42,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 17:00:42,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 17:00:42,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 17:00:42,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 17:00:42,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 17:00:42,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 17:00:42,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 17:00:42,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 17:00:42,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 17:00:42,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 17:00:42,365 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 17:00:42,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 17:00:42,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 17:00:42,366 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 17:00:42,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 17:00:42,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 17:00:42,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 17:00:42,570 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 17:00:42,571 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 17:00:42,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.i [2023-12-19 17:00:43,594 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 17:00:43,790 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 17:00:43,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.i [2023-12-19 17:00:43,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edbff9a44/264398e3e6f647e790b9c006101c24ec/FLAGe7927b4fd [2023-12-19 17:00:43,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edbff9a44/264398e3e6f647e790b9c006101c24ec [2023-12-19 17:00:43,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 17:00:43,815 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 17:00:43,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 17:00:43,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 17:00:43,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 17:00:43,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:00:43" (1/1) ... [2023-12-19 17:00:43,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@510f5d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:00:43, skipping insertion in model container [2023-12-19 17:00:43,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:00:43" (1/1) ... [2023-12-19 17:00:43,859 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 17:00:44,104 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.i[24177,24190] [2023-12-19 17:00:44,108 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 17:00:44,127 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 17:00:44,153 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_remove_all_reverse.i[24177,24190] [2023-12-19 17:00:44,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 17:00:44,175 INFO L206 MainTranslator]: Completed translation [2023-12-19 17:00:44,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:00:44 WrapperNode [2023-12-19 17:00:44,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 17:00:44,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 17:00:44,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 17:00:44,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 17:00:44,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:00:44" (1/1) ... [2023-12-19 17:00:44,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:00:44" (1/1) ... [2023-12-19 17:00:44,212 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 106 [2023-12-19 17:00:44,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 17:00:44,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 17:00:44,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 17:00:44,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 17:00:44,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:00:44" (1/1) ... [2023-12-19 17:00:44,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:00:44" (1/1) ... [2023-12-19 17:00:44,224 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:00:44" (1/1) ... [2023-12-19 17:00:44,236 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 11, 8]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2023-12-19 17:00:44,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:00:44" (1/1) ... [2023-12-19 17:00:44,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:00:44" (1/1) ... [2023-12-19 17:00:44,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:00:44" (1/1) ... [2023-12-19 17:00:44,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:00:44" (1/1) ... [2023-12-19 17:00:44,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:00:44" (1/1) ... [2023-12-19 17:00:44,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:00:44" (1/1) ... [2023-12-19 17:00:44,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 17:00:44,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 17:00:44,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 17:00:44,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 17:00:44,250 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:00:44" (1/1) ... [2023-12-19 17:00:44,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 17:00:44,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:00:44,284 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-19 17:00:44,289 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-19 17:00:44,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 17:00:44,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 17:00:44,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 17:00:44,304 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-19 17:00:44,304 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-19 17:00:44,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-19 17:00:44,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 17:00:44,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-19 17:00:44,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-19 17:00:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-19 17:00:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-19 17:00:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-19 17:00:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-19 17:00:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-19 17:00:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-19 17:00:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-19 17:00:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-19 17:00:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-19 17:00:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 17:00:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 17:00:44,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 17:00:44,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 17:00:44,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 17:00:44,397 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 17:00:44,398 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 17:00:44,532 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 17:00:44,561 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 17:00:44,561 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-19 17:00:44,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:00:44 BoogieIcfgContainer [2023-12-19 17:00:44,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 17:00:44,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 17:00:44,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 17:00:44,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 17:00:44,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:00:43" (1/3) ... [2023-12-19 17:00:44,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405700fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:00:44, skipping insertion in model container [2023-12-19 17:00:44,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:00:44" (2/3) ... [2023-12-19 17:00:44,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405700fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:00:44, skipping insertion in model container [2023-12-19 17:00:44,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:00:44" (3/3) ... [2023-12-19 17:00:44,567 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2023-12-19 17:00:44,578 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 17:00:44,579 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 17:00:44,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 17:00:44,614 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;@31d7c09f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 17:00:44,615 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 17:00:44,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:00:44,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-19 17:00:44,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:00:44,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:00:44,631 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:00:44,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:00:44,639 INFO L85 PathProgramCache]: Analyzing trace with hash -433254446, now seen corresponding path program 1 times [2023-12-19 17:00:44,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:00:44,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874921215] [2023-12-19 17:00:44,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:00:44,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:00:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:44,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:00:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:44,907 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-19 17:00:44,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:00:44,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874921215] [2023-12-19 17:00:44,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874921215] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:00:44,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:00:44,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 17:00:44,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959717929] [2023-12-19 17:00:44,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:00:44,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 17:00:44,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:00:44,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 17:00:44,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 17:00:44,943 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-19 17:00:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:00:44,988 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2023-12-19 17:00:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 17:00:44,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-19 17:00:44,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:00:44,994 INFO L225 Difference]: With dead ends: 32 [2023-12-19 17:00:44,995 INFO L226 Difference]: Without dead ends: 19 [2023-12-19 17:00:44,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 17:00:44,999 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:00:45,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:00:45,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-19 17:00:45,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-19 17:00:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:00:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-12-19 17:00:45,027 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2023-12-19 17:00:45,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:00:45,029 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-12-19 17:00:45,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-19 17:00:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-12-19 17:00:45,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-19 17:00:45,031 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:00:45,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:00:45,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 17:00:45,031 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:00:45,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:00:45,032 INFO L85 PathProgramCache]: Analyzing trace with hash -805433409, now seen corresponding path program 1 times [2023-12-19 17:00:45,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:00:45,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5515982] [2023-12-19 17:00:45,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:00:45,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:00:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:45,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:00:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:45,189 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-19 17:00:45,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:00:45,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5515982] [2023-12-19 17:00:45,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5515982] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:00:45,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:00:45,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 17:00:45,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873797381] [2023-12-19 17:00:45,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:00:45,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 17:00:45,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:00:45,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 17:00:45,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 17:00:45,199 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-19 17:00:45,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:00:45,242 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2023-12-19 17:00:45,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 17:00:45,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-19 17:00:45,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:00:45,244 INFO L225 Difference]: With dead ends: 32 [2023-12-19 17:00:45,244 INFO L226 Difference]: Without dead ends: 24 [2023-12-19 17:00:45,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 17:00:45,246 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:00:45,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 38 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:00:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-19 17:00:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2023-12-19 17:00:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:00:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-19 17:00:45,253 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2023-12-19 17:00:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:00:45,253 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-19 17:00:45,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-19 17:00:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-19 17:00:45,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-19 17:00:45,254 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:00:45,254 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:00:45,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 17:00:45,255 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:00:45,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:00:45,255 INFO L85 PathProgramCache]: Analyzing trace with hash 476536632, now seen corresponding path program 1 times [2023-12-19 17:00:45,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:00:45,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962699501] [2023-12-19 17:00:45,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:00:45,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:00:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:45,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:00:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:45,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 17:00:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 17:00:45,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:00:45,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962699501] [2023-12-19 17:00:45,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962699501] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:00:45,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:00:45,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 17:00:45,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096143657] [2023-12-19 17:00:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:00:45,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 17:00:45,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:00:45,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 17:00:45,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 17:00:45,434 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-19 17:00:45,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:00:45,495 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2023-12-19 17:00:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 17:00:45,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-12-19 17:00:45,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:00:45,497 INFO L225 Difference]: With dead ends: 27 [2023-12-19 17:00:45,497 INFO L226 Difference]: Without dead ends: 23 [2023-12-19 17:00:45,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 17:00:45,501 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 17:00:45,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 17:00:45,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-19 17:00:45,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-12-19 17:00:45,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:00:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-19 17:00:45,508 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 20 [2023-12-19 17:00:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:00:45,508 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-19 17:00:45,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-19 17:00:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-19 17:00:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-19 17:00:45,510 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:00:45,510 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:00:45,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 17:00:45,510 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:00:45,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:00:45,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1148802953, now seen corresponding path program 1 times [2023-12-19 17:00:45,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:00:45,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211184865] [2023-12-19 17:00:45,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:00:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:00:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:45,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:00:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:45,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 17:00:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 17:00:45,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:00:45,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211184865] [2023-12-19 17:00:45,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211184865] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:00:45,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234435607] [2023-12-19 17:00:45,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:00:45,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:00:45,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:00:45,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:00:45,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 17:00:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:45,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-19 17:00:45,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:00:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 17:00:45,863 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:00:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 17:00:45,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234435607] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:00:45,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:00:45,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-12-19 17:00:45,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087442487] [2023-12-19 17:00:45,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:00:45,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 17:00:45,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:00:45,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 17:00:45,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-19 17:00:45,919 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-19 17:00:45,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:00:45,992 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-12-19 17:00:45,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 17:00:45,993 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 23 [2023-12-19 17:00:45,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:00:45,994 INFO L225 Difference]: With dead ends: 28 [2023-12-19 17:00:45,994 INFO L226 Difference]: Without dead ends: 24 [2023-12-19 17:00:45,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-19 17:00:45,999 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 17:00:46,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 70 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 17:00:46,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-19 17:00:46,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-19 17:00:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:00:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-12-19 17:00:46,005 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 23 [2023-12-19 17:00:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:00:46,005 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-12-19 17:00:46,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-19 17:00:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-12-19 17:00:46,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-19 17:00:46,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:00:46,007 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:00:46,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 17:00:46,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:00:46,212 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:00:46,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:00:46,212 INFO L85 PathProgramCache]: Analyzing trace with hash -179084584, now seen corresponding path program 2 times [2023-12-19 17:00:46,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:00:46,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050997148] [2023-12-19 17:00:46,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:00:46,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:00:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:46,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:00:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:46,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 17:00:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-19 17:00:46,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:00:46,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050997148] [2023-12-19 17:00:46,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050997148] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:00:46,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:00:46,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 17:00:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39780537] [2023-12-19 17:00:46,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:00:46,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 17:00:46,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:00:46,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 17:00:46,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 17:00:46,452 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-19 17:00:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:00:46,526 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-12-19 17:00:46,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 17:00:46,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-12-19 17:00:46,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:00:46,527 INFO L225 Difference]: With dead ends: 33 [2023-12-19 17:00:46,527 INFO L226 Difference]: Without dead ends: 24 [2023-12-19 17:00:46,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-19 17:00:46,530 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:00:46,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 67 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:00:46,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-19 17:00:46,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-19 17:00:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:00:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-12-19 17:00:46,541 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 26 [2023-12-19 17:00:46,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:00:46,542 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-12-19 17:00:46,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-19 17:00:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-12-19 17:00:46,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-19 17:00:46,543 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:00:46,543 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:00:46,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 17:00:46,543 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:00:46,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:00:46,543 INFO L85 PathProgramCache]: Analyzing trace with hash 558232088, now seen corresponding path program 1 times [2023-12-19 17:00:46,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:00:46,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587237539] [2023-12-19 17:00:46,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:00:46,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:00:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:47,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:00:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:47,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 17:00:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:47,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:00:47,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:00:47,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587237539] [2023-12-19 17:00:47,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587237539] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:00:47,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004447288] [2023-12-19 17:00:47,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:00:47,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:00:47,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:00:47,876 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:00:47,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-19 17:00:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:00:48,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-19 17:00:48,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:00:48,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 17:00:48,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-19 17:00:48,524 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-19 17:00:48,525 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 11 treesize of output 11 [2023-12-19 17:00:48,585 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-19 17:00:48,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-19 17:00:48,654 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-12-19 17:00:48,817 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-19 17:00:48,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 77 [2023-12-19 17:00:48,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 62 [2023-12-19 17:00:49,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 73 [2023-12-19 17:00:49,040 INFO L349 Elim1Store]: treesize reduction 108, result has 4.4 percent of original size [2023-12-19 17:00:49,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 167 treesize of output 122 [2023-12-19 17:00:49,059 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 128 [2023-12-19 17:00:49,245 INFO L349 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-12-19 17:00:49,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 110 [2023-12-19 17:00:49,252 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 45 treesize of output 25 [2023-12-19 17:00:49,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-19 17:00:49,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-12-19 17:00:49,266 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 14 treesize of output 9 [2023-12-19 17:00:49,268 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 11 treesize of output 7 [2023-12-19 17:00:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:00:49,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:00:49,592 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 1335 treesize of output 1219 [2023-12-19 17:00:49,599 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 878 treesize of output 774 [2023-12-19 17:00:49,614 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse7 (select .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse5 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse7 .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse8)) (.cse2 (select (select (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse4 .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse8))) (and (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse4 .cse5 .cse2)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_668 Int) (v_ArrVal_665 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_665) .cse1 (store (select (store .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse7 .cse5 .cse1)) .cse1) .cse2 v_ArrVal_668)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5))))))) is different from false [2023-12-19 17:00:49,642 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse8 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse8)) (.cse4 (select (select (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse7 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse8))) (and (forall ((v_ArrVal_668 Int) (v_ArrVal_665 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_665) .cse1 (store (select (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 .cse3 .cse1)) .cse1) .cse4 v_ArrVal_668)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (let ((.cse5 (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse7 .cse3 .cse4)))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)))))) is different from false [2023-12-19 17:00:49,650 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 2646 treesize of output 2622 [2023-12-19 17:00:50,338 INFO L349 Elim1Store]: treesize reduction 367, result has 30.0 percent of original size [2023-12-19 17:00:50,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 1440 treesize of output 1121 [2023-12-19 17:00:50,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:00:50,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:00:50,697 INFO L349 Elim1Store]: treesize reduction 214, result has 23.0 percent of original size [2023-12-19 17:00:50,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 31 case distinctions, treesize of input 1507 treesize of output 1659 [2023-12-19 17:00:51,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:00:51,526 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-12-19 17:00:51,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1747 treesize of output 1731 [2023-12-19 17:00:51,604 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 1158 treesize of output 1154 [2023-12-19 17:00:51,641 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 1154 treesize of output 1150 [2023-12-19 17:00:51,681 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 1150 treesize of output 1146 [2023-12-19 17:00:51,756 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 1146 treesize of output 1142 [2023-12-19 17:00:51,833 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-19 17:00:51,913 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-19 17:00:51,942 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-19 17:00:51,990 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 8 treesize of output 4 [2023-12-19 17:00:52,082 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 8 treesize of output 4 [2023-12-19 17:00:52,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-19 17:00:52,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:00:52,282 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 25 treesize of output 25 [2023-12-19 17:00:52,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:00:52,343 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 26 treesize of output 26 [2023-12-19 17:00:52,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2023-12-19 17:00:52,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:00:52,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 272 treesize of output 272 [2023-12-19 17:00:52,611 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-19 17:00:52,611 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 202 treesize of output 194 [2023-12-19 17:00:52,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:00:52,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 220 treesize of output 246 [2023-12-19 17:00:52,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:00:52,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 338 treesize of output 344 [2023-12-19 17:00:53,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:00:53,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:00:53,303 INFO L349 Elim1Store]: treesize reduction 276, result has 19.8 percent of original size [2023-12-19 17:00:53,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 826 treesize of output 1055 [2023-12-19 17:00:53,508 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:00:53,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:00:53,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:00:53,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:00:53,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:00:53,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:00:53,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:00:53,518 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 191 [2023-12-19 17:00:53,524 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 8 treesize of output 4 [2023-12-19 17:00:53,545 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:00:53,545 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:00:53,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:00:53,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:00:53,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 203 treesize of output 217 [2023-12-19 17:00:53,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2023-12-19 17:00:53,607 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 16 treesize of output 12 [2023-12-19 17:00:53,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-19 17:00:53,643 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 8 treesize of output 4 [2023-12-19 17:00:53,654 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 8 treesize of output 4 [2023-12-19 17:00:53,668 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 8 treesize of output 4 [2023-12-19 17:00:53,678 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-12-19 17:00:53,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 199 treesize of output 185 [2023-12-19 17:00:53,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:00:53,706 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 193 treesize of output 193 [2023-12-19 17:00:53,724 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:00:53,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:00:53,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 227 treesize of output 233 [2023-12-19 17:00:53,785 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:00:53,785 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:00:53,789 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:00:53,988 INFO L349 Elim1Store]: treesize reduction 212, result has 29.3 percent of original size [2023-12-19 17:00:53,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 325 treesize of output 414 [2023-12-19 17:00:54,011 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:00:54,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:00:54,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:00:54,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:00:54,106 INFO L349 Elim1Store]: treesize reduction 215, result has 27.1 percent of original size [2023-12-19 17:00:54,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 319 treesize of output 365 [2023-12-19 17:00:54,123 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 117 treesize of output 113 [2023-12-19 17:00:54,280 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:00:54,315 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 8 treesize of output 4 [2023-12-19 17:00:54,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-19 17:00:54,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-19 17:00:54,383 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 8 treesize of output 4 [2023-12-19 17:00:54,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:00:54,428 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 25 treesize of output 25 [2023-12-19 17:00:54,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:00:54,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2023-12-19 17:00:54,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:00:54,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2023-12-19 17:00:54,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:00:54,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2023-12-19 17:00:54,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:00:54,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2023-12-19 17:00:54,765 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 180 treesize of output 172 [2023-12-19 17:00:54,835 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 180 treesize of output 172 [2023-12-19 17:00:54,972 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:00:54,978 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:00:54,978 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 28 treesize of output 1 [2023-12-19 17:00:54,989 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:00:54,997 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-19 17:00:55,080 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-19 17:00:55,080 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 188 treesize of output 179 [2023-12-19 17:00:55,114 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:00:55,114 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 188 treesize of output 176 [2023-12-19 17:00:55,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:00:55,141 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 176 treesize of output 176 [2023-12-19 17:00:55,207 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 8 treesize of output 4 [2023-12-19 17:00:55,364 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-12-19 17:00:55,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 23 [2023-12-19 17:00:55,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 28 [2023-12-19 17:00:55,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 104 [2023-12-19 17:00:55,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2023-12-19 17:00:55,496 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-12-19 17:00:55,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 215 treesize of output 189 [2023-12-19 17:00:55,539 INFO L349 Elim1Store]: treesize reduction 14, result has 26.3 percent of original size [2023-12-19 17:00:55,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 215 treesize of output 194 [2023-12-19 17:00:55,638 INFO L349 Elim1Store]: treesize reduction 14, result has 26.3 percent of original size [2023-12-19 17:00:55,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 34 [2023-12-19 17:00:55,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 519 treesize of output 477 [2023-12-19 17:00:55,801 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2023-12-19 17:00:55,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 32 [2023-12-19 17:00:55,857 INFO L349 Elim1Store]: treesize reduction 33, result has 26.7 percent of original size [2023-12-19 17:00:55,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 44 [2023-12-19 17:00:55,991 INFO L349 Elim1Store]: treesize reduction 33, result has 26.7 percent of original size [2023-12-19 17:00:55,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 223 treesize of output 204 [2023-12-19 17:00:56,098 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2023-12-19 17:00:56,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 223 treesize of output 193 [2023-12-19 17:00:56,141 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2023-12-19 17:00:56,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 527 treesize of output 489 [2023-12-19 17:00:56,250 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-12-19 17:00:56,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 108 [2023-12-19 17:00:56,332 INFO L349 Elim1Store]: treesize reduction 33, result has 26.7 percent of original size [2023-12-19 17:00:56,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 41 [2023-12-19 17:00:56,380 INFO L349 Elim1Store]: treesize reduction 33, result has 26.7 percent of original size [2023-12-19 17:00:56,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 41 [2023-12-19 17:00:56,478 INFO L349 Elim1Store]: treesize reduction 33, result has 26.7 percent of original size [2023-12-19 17:00:56,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 216 treesize of output 201 [2023-12-19 17:00:56,515 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2023-12-19 17:00:56,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 216 treesize of output 190 [2023-12-19 17:00:56,560 INFO L349 Elim1Store]: treesize reduction 33, result has 26.7 percent of original size [2023-12-19 17:00:56,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 216 treesize of output 201 [2023-12-19 17:00:56,622 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2023-12-19 17:00:56,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 29 [2023-12-19 17:00:56,692 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2023-12-19 17:00:56,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 29 [2023-12-19 17:00:56,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 817 treesize of output 755 [2023-12-19 17:00:56,849 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:00:56,854 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:00:57,352 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:01:05,048 WARN L293 SmtUtils]: Spent 7.68s on a formula simplification. DAG size of input: 443 DAG size of output: 439 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-19 17:01:05,049 INFO L349 Elim1Store]: treesize reduction 8, result has 99.0 percent of original size [2023-12-19 17:01:05,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 2 disjoint index pairs (out of 105 index pairs), introduced 17 new quantified variables, introduced 103 case distinctions, treesize of input 75209 treesize of output 70573 [2023-12-19 17:01:16,294 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 8 treesize of output 4 [2023-12-19 17:01:16,301 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 8 treesize of output 4 [2023-12-19 17:01:16,307 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 8 treesize of output 4 [2023-12-19 17:01:16,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:01:16,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 113 [2023-12-19 17:01:16,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:01:16,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 17 [2023-12-19 17:01:16,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-19 17:01:16,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004447288] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:01:16,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 17:01:16,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2023-12-19 17:01:16,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806532567] [2023-12-19 17:01:16,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 17:01:16,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-19 17:01:16,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:01:16,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-19 17:01:16,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=8, NotChecked=146, Total=1560 [2023-12-19 17:01:16,568 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 31 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-19 17:01:17,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:01:17,006 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2023-12-19 17:01:17,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 17:01:17,007 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-12-19 17:01:17,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:01:17,009 INFO L225 Difference]: With dead ends: 44 [2023-12-19 17:01:17,009 INFO L226 Difference]: Without dead ends: 31 [2023-12-19 17:01:17,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=183, Invalid=1623, Unknown=8, NotChecked=166, Total=1980 [2023-12-19 17:01:17,011 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 17:01:17,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 179 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 17:01:17,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-19 17:01:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-12-19 17:01:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:01:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-12-19 17:01:17,021 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 26 [2023-12-19 17:01:17,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:01:17,021 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-12-19 17:01:17,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-19 17:01:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-12-19 17:01:17,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-19 17:01:17,021 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:01:17,022 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:01:17,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-19 17:01:17,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-19 17:01:17,232 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:01:17,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:01:17,233 INFO L85 PathProgramCache]: Analyzing trace with hash -452885162, now seen corresponding path program 1 times [2023-12-19 17:01:17,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:01:17,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764883752] [2023-12-19 17:01:17,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:01:17,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:01:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:17,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:01:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:17,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 17:01:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-19 17:01:17,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:01:17,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764883752] [2023-12-19 17:01:17,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764883752] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:01:17,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839297833] [2023-12-19 17:01:17,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:01:17,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:01:17,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:01:17,317 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:01:17,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-19 17:01:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:17,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-19 17:01:17,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:01:17,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-19 17:01:17,479 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:01:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-19 17:01:17,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839297833] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:01:17,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:01:17,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-12-19 17:01:17,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668749451] [2023-12-19 17:01:17,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:01:17,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 17:01:17,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:01:17,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 17:01:17,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 17:01:17,506 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:01:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:01:17,552 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2023-12-19 17:01:17,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 17:01:17,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2023-12-19 17:01:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:01:17,553 INFO L225 Difference]: With dead ends: 49 [2023-12-19 17:01:17,554 INFO L226 Difference]: Without dead ends: 29 [2023-12-19 17:01:17,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-19 17:01:17,554 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:01:17,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 77 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:01:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-19 17:01:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-19 17:01:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 17:01:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-12-19 17:01:17,560 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 26 [2023-12-19 17:01:17,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:01:17,560 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-12-19 17:01:17,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 17:01:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-12-19 17:01:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-19 17:01:17,562 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:01:17,562 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:01:17,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-19 17:01:17,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:01:17,768 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:01:17,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:01:17,768 INFO L85 PathProgramCache]: Analyzing trace with hash 812530129, now seen corresponding path program 2 times [2023-12-19 17:01:17,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:01:17,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062347953] [2023-12-19 17:01:17,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:01:17,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:01:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:17,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 17:01:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:17,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 17:01:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:17,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 17:01:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:01:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-19 17:01:17,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:01:17,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062347953] [2023-12-19 17:01:17,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062347953] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:01:17,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985378590] [2023-12-19 17:01:17,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 17:01:17,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:01:17,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:01:17,903 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:01:17,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-19 17:01:18,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 17:01:18,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:01:18,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-19 17:01:18,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:01:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-19 17:01:18,108 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 17:01:18,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985378590] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:01:18,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 17:01:18,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-12-19 17:01:18,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893401483] [2023-12-19 17:01:18,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:01:18,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 17:01:18,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:01:18,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 17:01:18,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 17:01:18,110 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-19 17:01:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:01:18,125 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2023-12-19 17:01:18,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 17:01:18,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-12-19 17:01:18,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:01:18,127 INFO L225 Difference]: With dead ends: 32 [2023-12-19 17:01:18,127 INFO L226 Difference]: Without dead ends: 0 [2023-12-19 17:01:18,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 17:01:18,128 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:01:18,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:01:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-19 17:01:18,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-19 17:01:18,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 17:01:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-19 17:01:18,129 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2023-12-19 17:01:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:01:18,129 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-19 17:01:18,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-19 17:01:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-19 17:01:18,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-19 17:01:18,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 17:01:18,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-19 17:01:18,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:01:18,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-19 17:01:18,503 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 612) no Hoare annotation was computed. [2023-12-19 17:01:18,504 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_~len#1| 2) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) [2023-12-19 17:01:18,504 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2023-12-19 17:01:18,504 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 613 627) no Hoare annotation was computed. [2023-12-19 17:01:18,504 INFO L895 garLoopResultBuilder]: At program point L618-3(lines 618 620) the Hoare annotation is: (let ((.cse14 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse14 0))) (let ((.cse2 (select |#memory_$Pointer$#1.offset| .cse3)) (.cse15 (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (= (select .cse15 0) 0)) (.cse5 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse7 (= (select .cse2 4) 0)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (let ((.cse8 (select (select |#memory_$Pointer$#1.base| .cse3) 4))) (let ((.cse0 (select |#memory_$Pointer$#1.offset| .cse8)) (.cse4 (select |#memory_$Pointer$#1.base| .cse8))) (and (= |ULTIMATE.start_main_~i~0#1| 0) (= (select .cse0 4) 0) .cse1 (= (select .cse2 0) 0) (= .cse3 (select .cse4 4)) (= (select .cse0 0) 0) .cse5 .cse6 .cse7 (not (= .cse3 .cse8)) (= (select .cse4 0) .cse3)))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_17 Int)) (let ((.cse13 (select |#memory_$Pointer$#1.base| v_arrayElimCell_17))) (let ((.cse12 (select .cse13 4))) (let ((.cse9 (select |#memory_$Pointer$#1.offset| v_arrayElimCell_17)) (.cse11 (select (store (store |#memory_$Pointer$#1.base| .cse12 v_DerPreprocessor_1) .cse3 v_arrayElimArr_2) .cse12))) (and (= (select .cse9 4) 0) (= 0 (select .cse9 0)) (let ((.cse10 (select |#memory_$Pointer$#1.base| .cse12))) (= .cse10 (store .cse11 0 (select .cse10 0)))) (= .cse3 .cse12) (= (select (select |#memory_$Pointer$#1.offset| .cse12) 0) 0) (= .cse11 v_DerPreprocessor_1) (= .cse3 (select .cse13 0)) (not (= .cse3 v_arrayElimCell_17)) (= .cse12 (select v_arrayElimArr_2 4))))))) .cse1 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_main_~i~0#1| 1)) (and (= (select .cse14 |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select .cse15 |ULTIMATE.start_main_~#s~0#1.offset|) 0) .cse6)))))) [2023-12-19 17:01:18,504 INFO L899 garLoopResultBuilder]: For program point L618-4(lines 618 620) no Hoare annotation was computed. [2023-12-19 17:01:18,504 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 625) no Hoare annotation was computed. [2023-12-19 17:01:18,505 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (and (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2)) [2023-12-19 17:01:18,505 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-12-19 17:01:18,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-19 17:01:18,505 INFO L899 garLoopResultBuilder]: For program point L603(lines 603 611) no Hoare annotation was computed. [2023-12-19 17:01:18,505 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2023-12-19 17:01:18,505 INFO L899 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2023-12-19 17:01:18,505 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-19 17:01:18,505 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 613 627) no Hoare annotation was computed. [2023-12-19 17:01:18,505 INFO L899 garLoopResultBuilder]: For program point L621(lines 621 623) no Hoare annotation was computed. [2023-12-19 17:01:18,505 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0))) (or (and .cse0 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (let ((.cse4 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse5 (select |#memory_$Pointer$#1.offset| .cse4))) (and .cse0 (= .cse4 |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= .cse4 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) .cse1 .cse2 .cse3 (= (select .cse5 4) 0) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) 0) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (= 0 (select .cse5 0))))))) [2023-12-19 17:01:18,505 INFO L899 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2023-12-19 17:01:18,505 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2023-12-19 17:01:18,505 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-12-19 17:01:18,505 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) [2023-12-19 17:01:18,505 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2023-12-19 17:01:18,507 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2023-12-19 17:01:18,509 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 17:01:18,537 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-19 17:01:18,538 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-12-19 17:01:18,538 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated [2023-12-19 17:01:18,538 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-12-19 17:01:18,538 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-19 17:01:18,538 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][0] could not be translated [2023-12-19 17:01:18,538 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-12-19 17:01:18,539 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-12-19 17:01:18,539 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-12-19 17:01:18,539 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][0] could not be translated [2023-12-19 17:01:18,539 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-12-19 17:01:18,539 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_1 : [int]int, v_arrayElimArr_2 : [int]int, v_arrayElimCell_17 : int :: (((((((#memory_$Pointer$#1.offset[v_arrayElimCell_17][4] == 0 && 0 == #memory_$Pointer$#1.offset[v_arrayElimCell_17][0]) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_arrayElimCell_17][4]] == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_arrayElimCell_17][4] := v_DerPreprocessor_1][#memory_$Pointer$#2.base[~#s~0!base][0] := v_arrayElimArr_2][#memory_$Pointer$#1.base[v_arrayElimCell_17][4]][0 := #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_arrayElimCell_17][4]][0]]) && #memory_$Pointer$#2.base[~#s~0!base][0] == #memory_$Pointer$#1.base[v_arrayElimCell_17][4]) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_arrayElimCell_17][4]][0] == 0) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_arrayElimCell_17][4] := v_DerPreprocessor_1][#memory_$Pointer$#2.base[~#s~0!base][0] := v_arrayElimArr_2][#memory_$Pointer$#1.base[v_arrayElimCell_17][4]] == v_DerPreprocessor_1) && #memory_$Pointer$#2.base[~#s~0!base][0] == #memory_$Pointer$#1.base[v_arrayElimCell_17][0]) && !(#memory_$Pointer$#2.base[~#s~0!base][0] == v_arrayElimCell_17)) && #memory_$Pointer$#1.base[v_arrayElimCell_17][4] == v_arrayElimArr_2[4]) could not be translated [2023-12-19 17:01:18,539 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-12-19 17:01:18,539 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-12-19 17:01:18,539 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-19 17:01:18,539 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-12-19 17:01:18,540 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-19 17:01:18,541 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~last~0!base][4] could not be translated [2023-12-19 17:01:18,541 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~last~0!base][4] could not be translated [2023-12-19 17:01:18,541 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~last~0!base][4]][4] could not be translated [2023-12-19 17:01:18,541 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~last~0!base][4] could not be translated [2023-12-19 17:01:18,541 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~last~0!base][4]][0] could not be translated [2023-12-19 17:01:18,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 05:01:18 BoogieIcfgContainer [2023-12-19 17:01:18,541 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 17:01:18,542 INFO L158 Benchmark]: Toolchain (without parser) took 34726.50ms. Allocated memory was 261.1MB in the beginning and 829.4MB in the end (delta: 568.3MB). Free memory was 216.9MB in the beginning and 711.8MB in the end (delta: -494.8MB). Peak memory consumption was 74.6MB. Max. memory is 8.0GB. [2023-12-19 17:01:18,542 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 17:01:18,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.33ms. Allocated memory is still 261.1MB. Free memory was 216.9MB in the beginning and 198.6MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-19 17:01:18,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.72ms. Allocated memory is still 261.1MB. Free memory was 198.6MB in the beginning and 196.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 17:01:18,542 INFO L158 Benchmark]: Boogie Preprocessor took 35.61ms. Allocated memory is still 261.1MB. Free memory was 196.5MB in the beginning and 193.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 17:01:18,542 INFO L158 Benchmark]: RCFGBuilder took 313.16ms. Allocated memory is still 261.1MB. Free memory was 193.9MB in the beginning and 176.6MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-19 17:01:18,542 INFO L158 Benchmark]: TraceAbstraction took 33977.60ms. Allocated memory was 261.1MB in the beginning and 829.4MB in the end (delta: 568.3MB). Free memory was 176.1MB in the beginning and 711.8MB in the end (delta: -535.7MB). Peak memory consumption was 33.7MB. Max. memory is 8.0GB. [2023-12-19 17:01:18,543 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.09ms. Allocated memory is still 184.5MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 360.33ms. Allocated memory is still 261.1MB. Free memory was 216.9MB in the beginning and 198.6MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.72ms. Allocated memory is still 261.1MB. Free memory was 198.6MB in the beginning and 196.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.61ms. Allocated memory is still 261.1MB. Free memory was 196.5MB in the beginning and 193.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 313.16ms. Allocated memory is still 261.1MB. Free memory was 193.9MB in the beginning and 176.6MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 33977.60ms. Allocated memory was 261.1MB in the beginning and 829.4MB in the end (delta: 568.3MB). Free memory was 176.1MB in the beginning and 711.8MB in the end (delta: -535.7MB). Peak memory consumption was 33.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_1 : [int]int, v_arrayElimArr_2 : [int]int, v_arrayElimCell_17 : int :: (((((((#memory_$Pointer$#1.offset[v_arrayElimCell_17][4] == 0 && 0 == #memory_$Pointer$#1.offset[v_arrayElimCell_17][0]) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_arrayElimCell_17][4]] == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_arrayElimCell_17][4] := v_DerPreprocessor_1][#memory_$Pointer$#2.base[~#s~0!base][0] := v_arrayElimArr_2][#memory_$Pointer$#1.base[v_arrayElimCell_17][4]][0 := #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_arrayElimCell_17][4]][0]]) && #memory_$Pointer$#2.base[~#s~0!base][0] == #memory_$Pointer$#1.base[v_arrayElimCell_17][4]) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_arrayElimCell_17][4]][0] == 0) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_arrayElimCell_17][4] := v_DerPreprocessor_1][#memory_$Pointer$#2.base[~#s~0!base][0] := v_arrayElimArr_2][#memory_$Pointer$#1.base[v_arrayElimCell_17][4]] == v_DerPreprocessor_1) && #memory_$Pointer$#2.base[~#s~0!base][0] == #memory_$Pointer$#1.base[v_arrayElimCell_17][0]) && !(#memory_$Pointer$#2.base[~#s~0!base][0] == v_arrayElimCell_17)) && #memory_$Pointer$#1.base[v_arrayElimCell_17][4] == v_arrayElimArr_2[4]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~last~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~last~0!base][4]][0] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 625]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.9s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 521 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 404 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 581 IncrementalHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 117 mSDtfsCounter, 581 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 8 PreInvPairs, 15 NumberOfFragments, 442 HoareAnnotationTreeSize, 8 FormulaSimplifications, 6 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FormulaSimplificationsInter, 21 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 30.5s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 323 ConstructedInterpolants, 2 QuantifiedInterpolants, 2047 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1402 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 98/115 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: ((((i == 0) && (len == 2)) || ((len == 2) && (i <= 1))) || (len == 2)) - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (((2 == len) && (len == 2)) || ((len == 2) && (len <= 1))) RESULT: Ultimate proved your program to be correct! [2023-12-19 17:01:18,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...