/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 03:29:39,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 03:29:39,213 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-21 03:29:39,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 03:29:39,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 03:29:39,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 03:29:39,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 03:29:39,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 03:29:39,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 03:29:39,250 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 03:29:39,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 03:29:39,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 03:29:39,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 03:29:39,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 03:29:39,253 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 03:29:39,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 03:29:39,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 03:29:39,253 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 03:29:39,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 03:29:39,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 03:29:39,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 03:29:39,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 03:29:39,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 03:29:39,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 03:29:39,256 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 03:29:39,256 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 03:29:39,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 03:29:39,256 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 03:29:39,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 03:29:39,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 03:29:39,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 03:29:39,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 03:29:39,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:29:39,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 03:29:39,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 03:29:39,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 03:29:39,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 03:29:39,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 03:29:39,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 03:29:39,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 03:29:39,259 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 03:29:39,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 03:29:39,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 03:29:39,260 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 -> false [2023-12-21 03:29:39,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 03:29:39,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 03:29:39,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 03:29:39,508 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 03:29:39,508 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 03:29:39,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i [2023-12-21 03:29:40,622 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 03:29:40,847 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 03:29:40,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i [2023-12-21 03:29:40,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16bf33663/7354a36cb8b24e2b8c14fcdaf774a216/FLAG93c885230 [2023-12-21 03:29:40,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16bf33663/7354a36cb8b24e2b8c14fcdaf774a216 [2023-12-21 03:29:40,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 03:29:40,871 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 03:29:40,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 03:29:40,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 03:29:40,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 03:29:40,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:29:40" (1/1) ... [2023-12-21 03:29:40,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@468fc87f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:29:40, skipping insertion in model container [2023-12-21 03:29:40,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:29:40" (1/1) ... [2023-12-21 03:29:40,925 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 03:29:41,184 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i[23210,23223] [2023-12-21 03:29:41,190 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:29:41,198 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 03:29:41,241 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i[23210,23223] [2023-12-21 03:29:41,245 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:29:41,271 INFO L206 MainTranslator]: Completed translation [2023-12-21 03:29:41,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:29:41 WrapperNode [2023-12-21 03:29:41,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 03:29:41,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 03:29:41,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 03:29:41,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 03:29:41,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:29:41" (1/1) ... [2023-12-21 03:29:41,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:29:41" (1/1) ... [2023-12-21 03:29:41,304 INFO L138 Inliner]: procedures = 122, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2023-12-21 03:29:41,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 03:29:41,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 03:29:41,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 03:29:41,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 03:29:41,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:29:41" (1/1) ... [2023-12-21 03:29:41,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:29:41" (1/1) ... [2023-12-21 03:29:41,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:29:41" (1/1) ... [2023-12-21 03:29:41,333 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2023-12-21 03:29:41,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:29:41" (1/1) ... [2023-12-21 03:29:41,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:29:41" (1/1) ... [2023-12-21 03:29:41,337 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:29:41" (1/1) ... [2023-12-21 03:29:41,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:29:41" (1/1) ... [2023-12-21 03:29:41,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:29:41" (1/1) ... [2023-12-21 03:29:41,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:29:41" (1/1) ... [2023-12-21 03:29:41,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 03:29:41,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 03:29:41,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 03:29:41,352 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 03:29:41,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:29:41" (1/1) ... [2023-12-21 03:29:41,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:29:41,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:29:41,390 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-21 03:29:41,404 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-21 03:29:41,424 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-21 03:29:41,424 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-21 03:29:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 03:29:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 03:29:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 03:29:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 03:29:41,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 03:29:41,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 03:29:41,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 03:29:41,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 03:29:41,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 03:29:41,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 03:29:41,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 03:29:41,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 03:29:41,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 03:29:41,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 03:29:41,533 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 03:29:41,535 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 03:29:41,591 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-21 03:29:41,720 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 03:29:41,737 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 03:29:41,737 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-21 03:29:41,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:29:41 BoogieIcfgContainer [2023-12-21 03:29:41,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 03:29:41,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 03:29:41,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 03:29:41,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 03:29:41,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:29:40" (1/3) ... [2023-12-21 03:29:41,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12032c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:29:41, skipping insertion in model container [2023-12-21 03:29:41,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:29:41" (2/3) ... [2023-12-21 03:29:41,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12032c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:29:41, skipping insertion in model container [2023-12-21 03:29:41,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:29:41" (3/3) ... [2023-12-21 03:29:41,744 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_search_value-1.i [2023-12-21 03:29:41,759 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 03:29:41,759 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 03:29:41,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 03:29:41,804 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;@70bc865f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 03:29:41,804 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 03:29:41,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:29:41,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-21 03:29:41,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:29:41,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:29:41,813 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:29:41,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:29:41,817 INFO L85 PathProgramCache]: Analyzing trace with hash 357278617, now seen corresponding path program 1 times [2023-12-21 03:29:41,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:29:41,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965481172] [2023-12-21 03:29:41,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:29:41,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:29:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:29:41,939 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-21 03:29:41,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:29:41,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965481172] [2023-12-21 03:29:41,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965481172] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:29:41,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:29:41,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 03:29:41,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763086253] [2023-12-21 03:29:41,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:29:41,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 03:29:41,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:29:41,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 03:29:41,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 03:29:41,972 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:29:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:29:41,989 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2023-12-21 03:29:41,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 03:29:41,993 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-21 03:29:41,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:29:41,997 INFO L225 Difference]: With dead ends: 34 [2023-12-21 03:29:41,997 INFO L226 Difference]: Without dead ends: 17 [2023-12-21 03:29:41,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 03:29:42,002 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:29:42,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:29:42,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-21 03:29:42,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-21 03:29:42,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:29:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-21 03:29:42,025 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 8 [2023-12-21 03:29:42,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:29:42,026 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-21 03:29:42,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:29:42,026 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-21 03:29:42,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 03:29:42,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:29:42,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:29:42,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 03:29:42,027 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:29:42,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:29:42,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1991764778, now seen corresponding path program 1 times [2023-12-21 03:29:42,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:29:42,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066895363] [2023-12-21 03:29:42,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:29:42,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:29:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:29:42,095 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-21 03:29:42,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:29:42,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066895363] [2023-12-21 03:29:42,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066895363] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:29:42,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:29:42,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 03:29:42,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309675700] [2023-12-21 03:29:42,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:29:42,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 03:29:42,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:29:42,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 03:29:42,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:29:42,099 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:29:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:29:42,120 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2023-12-21 03:29:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 03:29:42,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-21 03:29:42,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:29:42,125 INFO L225 Difference]: With dead ends: 27 [2023-12-21 03:29:42,125 INFO L226 Difference]: Without dead ends: 18 [2023-12-21 03:29:42,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 03:29:42,126 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:29:42,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:29:42,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-21 03:29:42,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-21 03:29:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:29:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-12-21 03:29:42,130 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-12-21 03:29:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:29:42,131 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-12-21 03:29:42,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:29:42,131 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-12-21 03:29:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 03:29:42,131 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:29:42,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:29:42,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 03:29:42,132 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:29:42,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:29:42,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2049023080, now seen corresponding path program 1 times [2023-12-21 03:29:42,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:29:42,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083735017] [2023-12-21 03:29:42,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:29:42,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:29:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:29:42,249 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-21 03:29:42,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:29:42,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083735017] [2023-12-21 03:29:42,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083735017] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:29:42,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:29:42,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 03:29:42,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679300596] [2023-12-21 03:29:42,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:29:42,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:29:42,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:29:42,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:29:42,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:29:42,252 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:29:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:29:42,285 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2023-12-21 03:29:42,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:29:42,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-21 03:29:42,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:29:42,286 INFO L225 Difference]: With dead ends: 38 [2023-12-21 03:29:42,287 INFO L226 Difference]: Without dead ends: 23 [2023-12-21 03:29:42,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:29:42,288 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:29:42,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:29:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-21 03:29:42,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-12-21 03:29:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:29:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-21 03:29:42,294 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2023-12-21 03:29:42,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:29:42,294 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-21 03:29:42,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:29:42,295 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-21 03:29:42,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 03:29:42,295 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:29:42,295 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:29:42,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 03:29:42,296 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:29:42,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:29:42,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1438995548, now seen corresponding path program 1 times [2023-12-21 03:29:42,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:29:42,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139156075] [2023-12-21 03:29:42,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:29:42,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:29:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:29:42,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:29:42,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:29:42,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139156075] [2023-12-21 03:29:42,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139156075] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:29:42,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:29:42,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 03:29:42,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146271577] [2023-12-21 03:29:42,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:29:42,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:29:42,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:29:42,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:29:42,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:29:42,423 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:29:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:29:42,478 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2023-12-21 03:29:42,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:29:42,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-21 03:29:42,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:29:42,481 INFO L225 Difference]: With dead ends: 31 [2023-12-21 03:29:42,481 INFO L226 Difference]: Without dead ends: 28 [2023-12-21 03:29:42,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:29:42,483 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:29:42,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 23 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:29:42,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-21 03:29:42,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2023-12-21 03:29:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-21 03:29:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-21 03:29:42,487 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2023-12-21 03:29:42,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:29:42,487 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-21 03:29:42,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:29:42,488 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-21 03:29:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-21 03:29:42,488 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:29:42,488 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:29:42,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 03:29:42,489 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:29:42,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:29:42,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1477352526, now seen corresponding path program 1 times [2023-12-21 03:29:42,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:29:42,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949138350] [2023-12-21 03:29:42,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:29:42,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:29:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:29:42,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 03:29:42,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:29:42,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949138350] [2023-12-21 03:29:42,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949138350] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:29:42,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172889597] [2023-12-21 03:29:42,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:29:42,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:29:42,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:29:42,618 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-21 03:29:42,625 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-21 03:29:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:29:42,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 03:29:42,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:29:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 03:29:42,799 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:29:42,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 03:29:42,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172889597] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:29:42,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:29:42,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-12-21 03:29:42,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540212987] [2023-12-21 03:29:42,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:29:42,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 03:29:42,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:29:42,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 03:29:42,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-21 03:29:42,850 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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-21 03:29:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:29:42,944 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2023-12-21 03:29:42,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 03:29:42,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-21 03:29:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:29:42,946 INFO L225 Difference]: With dead ends: 55 [2023-12-21 03:29:42,946 INFO L226 Difference]: Without dead ends: 39 [2023-12-21 03:29:42,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-12-21 03:29:42,953 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:29:42,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:29:42,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-21 03:29:42,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2023-12-21 03:29:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:29:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-12-21 03:29:42,961 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 20 [2023-12-21 03:29:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:29:42,961 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-12-21 03:29:42,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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-21 03:29:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-12-21 03:29:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-21 03:29:42,962 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:29:42,963 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:29:42,974 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-21 03:29:43,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:29:43,164 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:29:43,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:29:43,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1302450726, now seen corresponding path program 2 times [2023-12-21 03:29:43,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:29:43,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346357432] [2023-12-21 03:29:43,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:29:43,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:29:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:29:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 03:29:43,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:29:43,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346357432] [2023-12-21 03:29:43,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346357432] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:29:43,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729214321] [2023-12-21 03:29:43,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:29:43,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:29:43,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:29:43,397 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-21 03:29:43,410 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-21 03:29:43,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:29:43,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:29:43,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-21 03:29:43,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:29:43,577 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 03:29:43,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:29:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 03:29:43,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729214321] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:29:43,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:29:43,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-12-21 03:29:43,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637149123] [2023-12-21 03:29:43,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:29:43,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 03:29:43,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:29:43,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 03:29:43,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2023-12-21 03:29:43,669 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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-21 03:29:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:29:43,828 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2023-12-21 03:29:43,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 03:29:43,829 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-21 03:29:43,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:29:43,832 INFO L225 Difference]: With dead ends: 85 [2023-12-21 03:29:43,832 INFO L226 Difference]: Without dead ends: 69 [2023-12-21 03:29:43,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2023-12-21 03:29:43,834 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:29:43,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 80 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:29:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-21 03:29:43,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2023-12-21 03:29:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:29:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2023-12-21 03:29:43,843 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 35 [2023-12-21 03:29:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:29:43,843 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2023-12-21 03:29:43,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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-21 03:29:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2023-12-21 03:29:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-21 03:29:43,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:29:43,845 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:29:43,853 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-21 03:29:44,051 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-21 03:29:44,051 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:29:44,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:29:44,052 INFO L85 PathProgramCache]: Analyzing trace with hash -2036934490, now seen corresponding path program 3 times [2023-12-21 03:29:44,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:29:44,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134730408] [2023-12-21 03:29:44,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:29:44,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:29:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:29:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 129 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-12-21 03:29:48,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:29:48,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134730408] [2023-12-21 03:29:48,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134730408] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:29:48,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9492287] [2023-12-21 03:29:48,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 03:29:48,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:29:48,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:29:48,131 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-21 03:29:48,152 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-21 03:29:56,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-21 03:29:56,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:29:56,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 131 conjunts are in the unsatisfiable core [2023-12-21 03:29:56,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:29:56,379 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-21 03:29:56,457 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-21 03:29:56,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-21 03:29:56,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-21 03:29:56,560 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-21 03:29:56,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2023-12-21 03:29:56,621 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-21 03:29:56,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-12-21 03:29:56,686 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-21 03:29:56,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2023-12-21 03:29:56,711 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 13 treesize of output 9 [2023-12-21 03:29:56,798 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-21 03:29:56,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2023-12-21 03:29:56,862 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-21 03:29:56,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-12-21 03:29:56,933 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-21 03:29:56,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2023-12-21 03:29:56,998 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-21 03:29:56,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-12-21 03:29:57,047 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-21 03:29:57,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2023-12-21 03:29:57,112 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-21 03:29:57,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-12-21 03:29:57,157 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-21 03:29:57,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2023-12-21 03:29:57,222 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-21 03:29:57,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-12-21 03:29:57,276 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-21 03:29:57,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2023-12-21 03:29:57,313 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-21 03:29:57,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-12-21 03:29:57,352 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-21 03:29:57,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2023-12-21 03:29:57,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:29:57,428 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-21 03:29:57,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-12-21 03:29:57,505 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-21 03:29:57,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2023-12-21 03:29:57,623 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2023-12-21 03:29:57,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 51 [2023-12-21 03:29:57,635 INFO L349 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2023-12-21 03:29:57,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-21 03:29:57,697 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 18 treesize of output 12 [2023-12-21 03:29:57,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2023-12-21 03:29:57,847 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-21 03:29:57,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 46 [2023-12-21 03:29:58,070 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-12-21 03:29:58,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 86 [2023-12-21 03:29:58,077 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 38 treesize of output 1 [2023-12-21 03:29:58,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:29:58,182 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 88 treesize of output 108 [2023-12-21 03:29:58,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:29:58,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 135 [2023-12-21 03:29:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 56 proven. 135 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-21 03:29:58,846 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:29:58,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:29:58,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2023-12-21 03:29:58,958 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 67 treesize of output 63 [2023-12-21 03:29:59,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:29:59,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-12-21 03:29:59,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:29:59,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 94 [2023-12-21 03:29:59,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:29:59,434 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 105 treesize of output 110 [2023-12-21 03:29:59,463 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 10 [2023-12-21 03:29:59,477 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 10 [2023-12-21 03:29:59,512 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_2 .cse3))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_595 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse0) (= .cse0 0) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_2) .cse1 v_arrayElimArr_1) .cse0 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= .cse1 .cse0)))) (= .cse1 0)))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse4 (select v_prenex_4 4)) (.cse5 (select v_arrayElimArr_2 .cse3))) (or (= .cse4 0) (= .cse5 .cse4) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_2) .cse5 v_prenex_4) .cse4 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= .cse5 0))))))) is different from false [2023-12-21 03:29:59,612 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int))) (let ((.cse2 (select v_prenex_4 4)) (.cse1 (select v_arrayElimArr_2 .cse4))) (or (not (= 0 (select (select (store (store (store .cse0 v_subst_1 v_arrayElimArr_2) .cse1 v_prenex_4) .cse2 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (= .cse1 .cse2) (= .cse2 0) (= .cse1 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_2 .cse4))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse5 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse5) (= .cse6 .cse5) (= .cse5 0) (not (= (select (select (store (store (store .cse0 v_subst_2 v_arrayElimArr_2) .cse6 v_arrayElimArr_1) .cse5 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0))))) (= .cse6 0)))))) is different from false [2023-12-21 03:29:59,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:29:59,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 106 [2023-12-21 03:29:59,727 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int))) (let ((.cse0 (select v_prenex_4 4)) (.cse1 (select v_arrayElimArr_2 4))) (or (= .cse0 .cse1) (= (select v_arrayElimArr_3 .cse2) 0) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_1 v_arrayElimArr_2) .cse1 v_prenex_4) .cse0 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse0 0) (= .cse1 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select v_arrayElimArr_3 .cse2) 0) (forall ((v_prenex_9 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse5 (select v_prenex_9 4)) (.cse4 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse4) (= .cse5 0) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse5 v_arrayElimArr_1) .cse4 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse4 0) (= .cse5 .cse4)))))))) is different from false [2023-12-21 03:30:00,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:30:00,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 122 [2023-12-21 03:30:01,762 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select v_arrayElimArr_4 .cse0) 0) (forall ((v_prenex_9 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse1 (select v_prenex_9 4)) (.cse2 (select v_arrayElimArr_1 4))) (or (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse1 v_arrayElimArr_1) .cse2 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse2) (= .cse1 0) (= .cse2 0) (= .cse1 .cse2) (= (select v_arrayElimArr_3 4) 0)))))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_3 Int) (v_prenex_11 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int))) (let ((.cse4 (select v_prenex_4 4)) (.cse5 (select v_arrayElimArr_2 4))) (or (= .cse4 .cse5) (= (select v_arrayElimArr_4 .cse0) 0) (= (select v_prenex_11 4) 0) (= .cse4 0) (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse5 v_prenex_4) .cse4 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse5 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-12-21 03:30:01,935 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_prenex_9 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse1 (select v_prenex_9 4)) (.cse0 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse0) (= .cse1 0) (= .cse0 0) (= .cse1 .cse0) (not (= (select (select (store (store (store (store (store .cse2 v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse1 v_arrayElimArr_1) .cse0 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= (select v_arrayElimArr_3 4) 0)))) (= (select v_arrayElimArr_4 .cse4) 0))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_11 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int))) (let ((.cse5 (select v_prenex_4 4)) (.cse6 (select v_arrayElimArr_2 4))) (or (= .cse5 .cse6) (= (select v_prenex_11 4) 0) (not (= (select (select (store (store (store (store (store .cse2 v_subst_5 v_arrayElimArr_4) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse6 v_prenex_4) .cse5 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= (select v_arrayElimArr_4 .cse4) 0) (= .cse5 0) (= .cse6 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-12-21 03:30:02,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:30:02,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 138 [2023-12-21 03:30:02,707 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_prenex_9 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse1 (select v_prenex_9 4)) (.cse0 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse0) (= .cse1 0) (= .cse0 0) (= .cse1 .cse0) (not (= (select (select (store (store (store (store (store (store .cse2 v_subst_8 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse1 v_arrayElimArr_1) .cse0 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0)))) (= (select v_arrayElimArr_5 .cse4) 0))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_subst_7 Int) (v_prenex_13 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_11 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_2 4)) (.cse5 (select v_prenex_4 4))) (or (= .cse5 .cse6) (= (select v_prenex_11 4) 0) (= (select v_prenex_13 4) 0) (= .cse5 0) (= (select v_arrayElimArr_5 .cse4) 0) (= .cse6 0) (not (= (select (select (store (store (store (store (store (store .cse2 v_subst_7 v_arrayElimArr_5) v_subst_5 v_prenex_13) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse6 v_prenex_4) .cse5 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-12-21 03:30:02,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:30:02,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 154 [2023-12-21 03:30:07,009 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (= (select v_arrayElimArr_6 .cse0) 0) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_9 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int)) (let ((.cse2 (select v_prenex_9 4)) (.cse1 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse1) (= (select v_arrayElimArr_5 4) 0) (= .cse2 0) (not (= 0 (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_subst_8 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse2 v_arrayElimArr_1) .cse1 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (= .cse1 0) (= .cse2 .cse1) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0)))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int)) (v_subst_7 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse4 (select v_prenex_4 4)) (.cse5 (select v_arrayElimArr_2 4))) (or (= (select v_arrayElimArr_6 .cse0) 0) (= .cse4 .cse5) (= (select v_prenex_11 4) 0) (= (select v_prenex_13 4) 0) (= .cse4 0) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_subst_7 v_prenex_15) v_subst_5 v_prenex_13) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse5 v_prenex_4) .cse4 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse5 0) (= (select v_prenex_15 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-12-21 03:30:07,311 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse0 (select v_prenex_4 4)) (.cse1 (select v_arrayElimArr_2 4))) (or (= .cse0 .cse1) (= (select v_prenex_11 4) 0) (not (= (select (select (store (store (store (store (store (store (store .cse2 v_subst_9 v_arrayElimArr_6) v_subst_7 v_prenex_15) v_subst_5 v_prenex_13) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse1 v_prenex_4) .cse0 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= (select v_prenex_13 4) 0) (= .cse0 0) (= (select v_arrayElimArr_6 .cse4) 0) (= .cse1 0) (= (select v_prenex_15 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_2 Int) (v_subst_10 Int)) (let ((.cse6 (select v_prenex_9 4)) (.cse5 (select v_arrayElimArr_1 4))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse5) (not (= (select (select (store (store (store (store (store (store (store .cse2 v_subst_10 v_arrayElimArr_6) v_subst_8 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse6 v_arrayElimArr_1) .cse5 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= (select v_arrayElimArr_5 4) 0) (= .cse6 0) (= .cse5 0) (= .cse6 .cse5) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0)))) (= (select v_arrayElimArr_6 .cse4) 0))))) is different from false [2023-12-21 03:30:07,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:30:07,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 170 [2023-12-21 03:30:09,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:30:09,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 186 [2023-12-21 03:30:09,329 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_subst_12 Int) (v_prenex_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_prenex_4 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int)) (v_subst_9 Int) (v_subst_7 Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse0 (select v_prenex_4 4)) (.cse1 (select v_arrayElimArr_2 4))) (or (= .cse0 .cse1) (= (select v_prenex_11 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) v_subst_12 v_prenex_19) v_subst_9 v_prenex_17) v_subst_7 v_prenex_15) v_subst_5 v_prenex_13) v_subst_3 v_prenex_11) v_subst_1 v_arrayElimArr_2) .cse1 v_prenex_4) .cse0 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_prenex_13 4) 0) (= .cse0 0) (= (select v_arrayElimArr_8 .cse3) 0) (= 0 (select v_prenex_17 4)) (= .cse1 0) (= (select v_prenex_19 4) 0) (= (select v_prenex_15 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_8 (Array Int Int))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_595 (Array Int Int)) (v_subst_11 Int) (v_subst_2 Int) (v_subst_10 Int) (v_prenex_9 (Array Int Int)) (v_subst_8 Int)) (let ((.cse5 (select v_prenex_9 4)) (.cse4 (select v_arrayElimArr_1 4))) (or (= (select v_arrayElimArr_6 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse4) (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) v_subst_11 v_arrayElimArr_7) v_subst_10 v_arrayElimArr_6) v_subst_8 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_prenex_9) .cse5 v_arrayElimArr_1) .cse4 v_ArrVal_595) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= .cse5 0) (= 0 (select v_arrayElimArr_7 4)) (= .cse4 0) (= .cse5 .cse4) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0)))) (= (select v_arrayElimArr_8 .cse3) 0))))) is different from false [2023-12-21 03:30:11,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:30:11,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2023-12-21 03:30:11,547 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 03:31:44,455 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-21 03:31:44,472 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-21 03:31:44,656 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-21 03:31:44,657 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 106607 column 7: canceled at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 106607 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1511) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:230) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 55 more [2023-12-21 03:31:44,661 INFO L158 Benchmark]: Toolchain (without parser) took 123789.67ms. Allocated memory was 208.7MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 141.2MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2023-12-21 03:31:44,661 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 208.7MB. Free memory is still 157.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 03:31:44,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.05ms. Allocated memory was 208.7MB in the beginning and 334.5MB in the end (delta: 125.8MB). Free memory was 141.0MB in the beginning and 294.5MB in the end (delta: -153.5MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. [2023-12-21 03:31:44,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.13ms. Allocated memory is still 334.5MB. Free memory was 294.4MB in the beginning and 292.5MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 03:31:44,662 INFO L158 Benchmark]: Boogie Preprocessor took 38.24ms. Allocated memory is still 334.5MB. Free memory was 292.5MB in the beginning and 290.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:31:44,662 INFO L158 Benchmark]: RCFGBuilder took 393.26ms. Allocated memory is still 334.5MB. Free memory was 290.3MB in the beginning and 285.8MB in the end (delta: 4.4MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. [2023-12-21 03:31:44,662 INFO L158 Benchmark]: TraceAbstraction took 122920.96ms. Allocated memory was 334.5MB in the beginning and 8.0GB in the end (delta: 7.6GB). Free memory was 285.3MB in the beginning and 5.0GB in the end (delta: -4.8GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2023-12-21 03:31:44,663 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.59ms. Allocated memory is still 208.7MB. Free memory is still 157.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 400.05ms. Allocated memory was 208.7MB in the beginning and 334.5MB in the end (delta: 125.8MB). Free memory was 141.0MB in the beginning and 294.5MB in the end (delta: -153.5MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.13ms. Allocated memory is still 334.5MB. Free memory was 294.4MB in the beginning and 292.5MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.24ms. Allocated memory is still 334.5MB. Free memory was 292.5MB in the beginning and 290.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 393.26ms. Allocated memory is still 334.5MB. Free memory was 290.3MB in the beginning and 285.8MB in the end (delta: 4.4MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. * TraceAbstraction took 122920.96ms. Allocated memory was 334.5MB in the beginning and 8.0GB in the end (delta: 7.6GB). Free memory was 285.3MB in the beginning and 5.0GB in the end (delta: -4.8GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 106607 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 106607 column 7: canceled: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-12-21 03:31:44,884 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-21 03:31:44,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...