/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-simple/sll2c_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:43:26,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:43:26,061 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-16 04:43:26,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:43:26,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:43:26,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:43:26,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:43:26,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:43:26,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:43:26,093 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:43:26,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:43:26,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:43:26,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:43:26,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:43:26,094 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:43:26,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:43:26,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:43:26,095 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:43:26,095 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:43:26,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:43:26,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:43:26,096 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:43:26,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:43:26,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:43:26,096 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:43:26,096 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:43:26,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:43:26,097 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:43:26,097 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:43:26,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:43:26,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:43:26,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:43:26,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:43:26,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:43:26,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:43:26,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:43:26,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:43:26,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:43:26,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:43:26,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:43:26,099 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:43:26,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:43:26,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:43:26,100 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-16 04:43:26,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:43:26,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:43:26,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:43:26,313 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:43:26,314 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:43:26,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_update_all.i [2023-12-16 04:43:27,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:43:27,646 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:43:27,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_update_all.i [2023-12-16 04:43:27,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0342de542/85779e7de2144ce49a195b2d5830b7e1/FLAGba87ef3ac [2023-12-16 04:43:27,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0342de542/85779e7de2144ce49a195b2d5830b7e1 [2023-12-16 04:43:27,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:43:27,672 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:43:27,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:43:27,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:43:27,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:43:27,679 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:43:27" (1/1) ... [2023-12-16 04:43:27,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24960c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:27, skipping insertion in model container [2023-12-16 04:43:27,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:43:27" (1/1) ... [2023-12-16 04:43:27,719 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:43:27,937 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_update_all.i[24418,24431] [2023-12-16 04:43:27,943 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:43:27,953 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:43:27,984 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_update_all.i[24418,24431] [2023-12-16 04:43:27,985 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:43:28,012 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:43:28,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:28 WrapperNode [2023-12-16 04:43:28,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:43:28,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:43:28,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:43:28,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:43:28,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:28" (1/1) ... [2023-12-16 04:43:28,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:28" (1/1) ... [2023-12-16 04:43:28,056 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 132 [2023-12-16 04:43:28,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:43:28,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:43:28,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:43:28,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:43:28,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:28" (1/1) ... [2023-12-16 04:43:28,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:28" (1/1) ... [2023-12-16 04:43:28,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:28" (1/1) ... [2023-12-16 04:43:28,080 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2023-12-16 04:43:28,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:28" (1/1) ... [2023-12-16 04:43:28,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:28" (1/1) ... [2023-12-16 04:43:28,086 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:28" (1/1) ... [2023-12-16 04:43:28,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:28" (1/1) ... [2023-12-16 04:43:28,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:28" (1/1) ... [2023-12-16 04:43:28,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:28" (1/1) ... [2023-12-16 04:43:28,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:43:28,109 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:43:28,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:43:28,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:43:28,110 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:28" (1/1) ... [2023-12-16 04:43:28,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:43:28,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:28,137 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-16 04:43:28,157 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-16 04:43:28,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:43:28,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:43:28,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:43:28,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:43:28,162 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-16 04:43:28,162 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-16 04:43:28,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 04:43:28,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:43:28,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 04:43:28,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 04:43:28,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 04:43:28,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 04:43:28,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 04:43:28,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:43:28,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:43:28,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:43:28,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:43:28,271 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:43:28,273 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:43:28,413 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:43:28,446 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:43:28,446 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-16 04:43:28,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:43:28 BoogieIcfgContainer [2023-12-16 04:43:28,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:43:28,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:43:28,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:43:28,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:43:28,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:43:27" (1/3) ... [2023-12-16 04:43:28,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c10435a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:43:28, skipping insertion in model container [2023-12-16 04:43:28,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:28" (2/3) ... [2023-12-16 04:43:28,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c10435a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:43:28, skipping insertion in model container [2023-12-16 04:43:28,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:43:28" (3/3) ... [2023-12-16 04:43:28,452 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2023-12-16 04:43:28,465 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:43:28,465 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:43:28,497 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:43:28,501 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;@27439074, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:43:28,501 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:43:28,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:43:28,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 04:43:28,510 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:28,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:28,511 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:28,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:28,542 INFO L85 PathProgramCache]: Analyzing trace with hash 816945935, now seen corresponding path program 1 times [2023-12-16 04:43:28,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:28,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077418387] [2023-12-16 04:43:28,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:28,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:28,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:28,803 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-16 04:43:28,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:28,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077418387] [2023-12-16 04:43:28,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077418387] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:43:28,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:43:28,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:43:28,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032202409] [2023-12-16 04:43:28,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:43:28,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:43:28,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:28,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:43:28,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:43:28,841 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:43:28,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:28,895 INFO L93 Difference]: Finished difference Result 46 states and 72 transitions. [2023-12-16 04:43:28,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:43:28,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-12-16 04:43:28,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:28,901 INFO L225 Difference]: With dead ends: 46 [2023-12-16 04:43:28,902 INFO L226 Difference]: Without dead ends: 20 [2023-12-16 04:43:28,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:43:28,907 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:28,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:43:28,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-16 04:43:28,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-16 04:43:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:43:28,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-12-16 04:43:28,934 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2023-12-16 04:43:28,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:28,935 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-12-16 04:43:28,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:43:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-12-16 04:43:28,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 04:43:28,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:28,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:28,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:43:28,938 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:28,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:28,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1614030004, now seen corresponding path program 1 times [2023-12-16 04:43:28,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:28,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368797551] [2023-12-16 04:43:28,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:28,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:29,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:29,103 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-16 04:43:29,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:29,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368797551] [2023-12-16 04:43:29,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368797551] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:43:29,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:43:29,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:43:29,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648562048] [2023-12-16 04:43:29,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:43:29,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:43:29,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:29,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:43:29,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:43:29,114 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:43:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:29,151 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2023-12-16 04:43:29,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:43:29,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-12-16 04:43:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:29,153 INFO L225 Difference]: With dead ends: 34 [2023-12-16 04:43:29,153 INFO L226 Difference]: Without dead ends: 23 [2023-12-16 04:43:29,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:43:29,155 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:29,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:43:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-16 04:43:29,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-12-16 04:43:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:43:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-12-16 04:43:29,165 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 15 [2023-12-16 04:43:29,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:29,165 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-12-16 04:43:29,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:43:29,165 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-12-16 04:43:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 04:43:29,166 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:29,167 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:29,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:43:29,167 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:29,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:29,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2105803652, now seen corresponding path program 1 times [2023-12-16 04:43:29,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:29,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49999009] [2023-12-16 04:43:29,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:29,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:29,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:29,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 04:43:29,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:29,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49999009] [2023-12-16 04:43:29,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49999009] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:43:29,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:43:29,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:43:29,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738653624] [2023-12-16 04:43:29,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:43:29,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:43:29,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:29,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:43:29,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:43:29,347 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 04:43:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:29,410 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2023-12-16 04:43:29,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:43:29,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2023-12-16 04:43:29,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:29,412 INFO L225 Difference]: With dead ends: 37 [2023-12-16 04:43:29,412 INFO L226 Difference]: Without dead ends: 30 [2023-12-16 04:43:29,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:43:29,413 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:29,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 39 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:43:29,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-16 04:43:29,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2023-12-16 04:43:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:43:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2023-12-16 04:43:29,417 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 21 [2023-12-16 04:43:29,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:29,417 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-12-16 04:43:29,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 04:43:29,417 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2023-12-16 04:43:29,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 04:43:29,418 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:29,418 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:29,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:43:29,418 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:29,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:29,419 INFO L85 PathProgramCache]: Analyzing trace with hash 234978919, now seen corresponding path program 1 times [2023-12-16 04:43:29,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:29,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377264937] [2023-12-16 04:43:29,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:29,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:29,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:29,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 04:43:29,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:29,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377264937] [2023-12-16 04:43:29,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377264937] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:29,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134851722] [2023-12-16 04:43:29,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:29,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:29,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:29,611 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-16 04:43:29,660 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-16 04:43:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:29,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 04:43:29,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:29,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 04:43:29,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:43:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 04:43:29,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134851722] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:43:29,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:43:29,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-12-16 04:43:29,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627354276] [2023-12-16 04:43:29,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:43:29,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:43:29,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:29,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:43:29,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:43:29,893 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 04:43:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:29,942 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2023-12-16 04:43:29,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:43:29,942 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2023-12-16 04:43:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:29,943 INFO L225 Difference]: With dead ends: 39 [2023-12-16 04:43:29,943 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 04:43:29,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:43:29,944 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:29,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 57 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:43:29,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 04:43:29,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2023-12-16 04:43:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:43:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2023-12-16 04:43:29,949 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 24 [2023-12-16 04:43:29,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:29,949 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2023-12-16 04:43:29,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 04:43:29,949 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2023-12-16 04:43:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 04:43:29,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:29,950 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:29,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-16 04:43:30,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:30,156 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:30,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1399533724, now seen corresponding path program 2 times [2023-12-16 04:43:30,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:30,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098372798] [2023-12-16 04:43:30,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:30,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:30,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:30,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 04:43:30,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:30,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098372798] [2023-12-16 04:43:30,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098372798] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:30,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139419742] [2023-12-16 04:43:30,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 04:43:30,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:30,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:30,305 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-16 04:43:30,307 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-16 04:43:30,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 04:43:30,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:43:30,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 04:43:30,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:30,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 04:43:30,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:43:30,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 04:43:30,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139419742] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:43:30,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:43:30,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-12-16 04:43:30,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34217935] [2023-12-16 04:43:30,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:43:30,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:43:30,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:30,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:43:30,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:43:30,479 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 04:43:30,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:30,527 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-12-16 04:43:30,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:43:30,528 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2023-12-16 04:43:30,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:30,528 INFO L225 Difference]: With dead ends: 42 [2023-12-16 04:43:30,528 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 04:43:30,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:43:30,529 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:30,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 86 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:43:30,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 04:43:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2023-12-16 04:43:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:43:30,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-12-16 04:43:30,533 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 27 [2023-12-16 04:43:30,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:30,534 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-12-16 04:43:30,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 04:43:30,534 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-12-16 04:43:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 04:43:30,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:30,534 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:30,561 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-16 04:43:30,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:30,741 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:30,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:30,741 INFO L85 PathProgramCache]: Analyzing trace with hash 896199806, now seen corresponding path program 1 times [2023-12-16 04:43:30,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:30,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150166004] [2023-12-16 04:43:30,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:30,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:31,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:31,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:43:31,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:31,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150166004] [2023-12-16 04:43:31,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150166004] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:31,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130201882] [2023-12-16 04:43:31,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:31,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:31,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:31,586 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-16 04:43:31,588 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-16 04:43:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:31,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 92 conjunts are in the unsatisfiable core [2023-12-16 04:43:31,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:31,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-16 04:43:31,835 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-16 04:43:31,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-16 04:43:31,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:43:31,923 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 04:43:31,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-16 04:43:32,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-16 04:43:32,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:43:32,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-16 04:43:32,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 04:43:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:43:32,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:43:32,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:43:32,544 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 29 treesize of output 30 [2023-12-16 04:43:32,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:43:32,553 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 50 treesize of output 49 [2023-12-16 04:43:32,558 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 14 [2023-12-16 04:43:32,704 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_472 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_472) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2023-12-16 04:43:32,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:43:32,710 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 19 treesize of output 20 [2023-12-16 04:43:32,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-12-16 04:43:32,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-16 04:43:33,052 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-16 04:43:33,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130201882] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:43:33,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:43:33,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 20] total 51 [2023-12-16 04:43:33,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199600624] [2023-12-16 04:43:33,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:43:33,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-16 04:43:33,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:33,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-16 04:43:33,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2263, Unknown=17, NotChecked=96, Total=2550 [2023-12-16 04:43:33,055 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 51 states, 46 states have (on average 1.391304347826087) internal successors, (64), 42 states have internal predecessors, (64), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-16 04:43:33,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:33,925 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2023-12-16 04:43:33,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 04:43:33,925 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 46 states have (on average 1.391304347826087) internal successors, (64), 42 states have internal predecessors, (64), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 28 [2023-12-16 04:43:33,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:33,927 INFO L225 Difference]: With dead ends: 61 [2023-12-16 04:43:33,927 INFO L226 Difference]: Without dead ends: 59 [2023-12-16 04:43:33,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=272, Invalid=3021, Unknown=17, NotChecked=112, Total=3422 [2023-12-16 04:43:33,928 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 132 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:33,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 363 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 641 Invalid, 0 Unknown, 62 Unchecked, 0.5s Time] [2023-12-16 04:43:33,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-16 04:43:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2023-12-16 04:43:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 04:43:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2023-12-16 04:43:33,935 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 28 [2023-12-16 04:43:33,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:33,935 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2023-12-16 04:43:33,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 46 states have (on average 1.391304347826087) internal successors, (64), 42 states have internal predecessors, (64), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-16 04:43:33,935 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2023-12-16 04:43:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 04:43:33,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:33,936 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:33,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-16 04:43:34,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:34,141 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:34,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:34,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2012409567, now seen corresponding path program 1 times [2023-12-16 04:43:34,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:34,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630352109] [2023-12-16 04:43:34,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:34,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:34,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:34,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:34,226 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-16 04:43:34,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:34,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630352109] [2023-12-16 04:43:34,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630352109] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:43:34,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:43:34,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:43:34,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863642421] [2023-12-16 04:43:34,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:43:34,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:43:34,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:34,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:43:34,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:43:34,228 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 04:43:34,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:34,269 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2023-12-16 04:43:34,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:43:34,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-12-16 04:43:34,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:34,270 INFO L225 Difference]: With dead ends: 55 [2023-12-16 04:43:34,270 INFO L226 Difference]: Without dead ends: 49 [2023-12-16 04:43:34,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:43:34,271 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:34,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 53 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:43:34,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-16 04:43:34,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2023-12-16 04:43:34,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 04:43:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2023-12-16 04:43:34,278 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 29 [2023-12-16 04:43:34,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:34,278 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2023-12-16 04:43:34,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 04:43:34,278 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2023-12-16 04:43:34,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 04:43:34,278 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:34,279 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:34,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:43:34,279 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:34,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:34,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1822249764, now seen corresponding path program 2 times [2023-12-16 04:43:34,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:34,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652989920] [2023-12-16 04:43:34,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:34,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:34,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:34,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 04:43:34,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:34,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652989920] [2023-12-16 04:43:34,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652989920] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:34,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450526401] [2023-12-16 04:43:34,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 04:43:34,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:34,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:34,363 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:43:34,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 04:43:34,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 04:43:34,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:43:34,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 04:43:34,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 04:43:34,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:43:34,526 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 04:43:34,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450526401] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:43:34,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:43:34,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2023-12-16 04:43:34,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27547520] [2023-12-16 04:43:34,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:43:34,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:43:34,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:34,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:43:34,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:43:34,528 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 04:43:34,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:34,586 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2023-12-16 04:43:34,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:43:34,587 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-12-16 04:43:34,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:34,588 INFO L225 Difference]: With dead ends: 77 [2023-12-16 04:43:34,588 INFO L226 Difference]: Without dead ends: 61 [2023-12-16 04:43:34,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:43:34,588 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:34,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 62 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:43:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-16 04:43:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2023-12-16 04:43:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 04:43:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-12-16 04:43:34,594 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 29 [2023-12-16 04:43:34,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:34,594 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-12-16 04:43:34,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 04:43:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-12-16 04:43:34,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 04:43:34,595 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:34,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:34,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 04:43:34,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:34,801 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:34,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:34,801 INFO L85 PathProgramCache]: Analyzing trace with hash -799402572, now seen corresponding path program 1 times [2023-12-16 04:43:34,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:34,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506260627] [2023-12-16 04:43:34,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:34,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:34,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:34,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-16 04:43:34,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:34,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506260627] [2023-12-16 04:43:34,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506260627] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:34,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499213198] [2023-12-16 04:43:34,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:34,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:34,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:34,866 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:43:34,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 04:43:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:35,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 04:43:35,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-16 04:43:35,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:43:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-16 04:43:35,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499213198] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:43:35,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:43:35,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2023-12-16 04:43:35,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447543120] [2023-12-16 04:43:35,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:43:35,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:43:35,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:35,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:43:35,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:43:35,051 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 04:43:35,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:35,104 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2023-12-16 04:43:35,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:43:35,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2023-12-16 04:43:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:35,105 INFO L225 Difference]: With dead ends: 60 [2023-12-16 04:43:35,105 INFO L226 Difference]: Without dead ends: 54 [2023-12-16 04:43:35,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:43:35,105 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:35,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 81 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:43:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-16 04:43:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2023-12-16 04:43:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 04:43:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2023-12-16 04:43:35,111 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 32 [2023-12-16 04:43:35,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:35,111 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2023-12-16 04:43:35,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 04:43:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2023-12-16 04:43:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 04:43:35,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:35,112 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:35,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-16 04:43:35,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:35,318 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:35,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:35,319 INFO L85 PathProgramCache]: Analyzing trace with hash 988343401, now seen corresponding path program 1 times [2023-12-16 04:43:35,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:35,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951285846] [2023-12-16 04:43:35,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:35,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:36,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:36,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:43:36,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:36,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951285846] [2023-12-16 04:43:36,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951285846] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:36,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667330801] [2023-12-16 04:43:36,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:36,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:36,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:36,346 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:43:36,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-16 04:43:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:36,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 102 conjunts are in the unsatisfiable core [2023-12-16 04:43:36,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:36,513 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-16 04:43:36,663 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-16 04:43:36,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-16 04:43:36,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-16 04:43:36,763 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 04:43:36,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-16 04:43:36,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:43:36,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-12-16 04:43:36,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-16 04:43:36,995 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 04:43:36,995 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 66 treesize of output 59 [2023-12-16 04:43:36,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-12-16 04:43:37,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-12-16 04:43:37,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-12-16 04:43:37,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-16 04:43:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:43:37,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:43:37,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 56 [2023-12-16 04:43:37,604 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_917 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_917) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (forall ((v_ArrVal_915 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_915) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2023-12-16 04:43:37,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 361 treesize of output 329 [2023-12-16 04:43:37,717 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 77 treesize of output 75 [2023-12-16 04:43:37,729 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 75 treesize of output 71 [2023-12-16 04:43:37,753 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_913 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_913) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= v_ArrVal_913 (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_913 .cse0))))))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2023-12-16 04:43:37,828 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_912 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| Int) (v_DerPreprocessor_6 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_912) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| 4) v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2023-12-16 04:43:37,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:43:37,839 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 24 treesize of output 25 [2023-12-16 04:43:37,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-12-16 04:43:37,843 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:43:37,844 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 34 treesize of output 30 [2023-12-16 04:43:37,846 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:43:37,847 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 20 treesize of output 18 [2023-12-16 04:43:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-12-16 04:43:38,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667330801] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:43:38,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:43:38,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 22] total 60 [2023-12-16 04:43:38,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176985507] [2023-12-16 04:43:38,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:43:38,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-12-16 04:43:38,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:38,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-12-16 04:43:38,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2983, Unknown=41, NotChecked=336, Total=3540 [2023-12-16 04:43:38,223 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 60 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 51 states have internal predecessors, (82), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-16 04:43:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:39,513 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2023-12-16 04:43:39,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 04:43:39,514 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 51 states have internal predecessors, (82), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 33 [2023-12-16 04:43:39,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:39,514 INFO L225 Difference]: With dead ends: 82 [2023-12-16 04:43:39,514 INFO L226 Difference]: Without dead ends: 80 [2023-12-16 04:43:39,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=353, Invalid=5018, Unknown=43, NotChecked=438, Total=5852 [2023-12-16 04:43:39,516 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 132 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:39,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 586 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 999 Invalid, 0 Unknown, 191 Unchecked, 0.5s Time] [2023-12-16 04:43:39,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-16 04:43:39,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2023-12-16 04:43:39,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 04:43:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2023-12-16 04:43:39,523 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 33 [2023-12-16 04:43:39,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:39,524 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2023-12-16 04:43:39,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 51 states have internal predecessors, (82), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-16 04:43:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2023-12-16 04:43:39,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 04:43:39,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:39,539 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:39,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-16 04:43:39,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:39,740 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:39,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2115144411, now seen corresponding path program 3 times [2023-12-16 04:43:39,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:39,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68188921] [2023-12-16 04:43:39,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:39,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:39,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-16 04:43:39,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:39,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68188921] [2023-12-16 04:43:39,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68188921] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:39,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279493636] [2023-12-16 04:43:39,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 04:43:39,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:39,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:39,877 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:43:39,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-16 04:43:40,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-16 04:43:40,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:43:40,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 04:43:40,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-16 04:43:40,130 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:43:40,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279493636] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:43:40,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 04:43:40,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2023-12-16 04:43:40,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281740996] [2023-12-16 04:43:40,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:43:40,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:43:40,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:40,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:43:40,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:43:40,132 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 04:43:40,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:40,163 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2023-12-16 04:43:40,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:43:40,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2023-12-16 04:43:40,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:40,164 INFO L225 Difference]: With dead ends: 79 [2023-12-16 04:43:40,164 INFO L226 Difference]: Without dead ends: 53 [2023-12-16 04:43:40,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:43:40,166 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:40,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 38 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:43:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-16 04:43:40,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2023-12-16 04:43:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 04:43:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2023-12-16 04:43:40,177 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 33 [2023-12-16 04:43:40,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:40,177 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2023-12-16 04:43:40,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 04:43:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2023-12-16 04:43:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 04:43:40,178 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:40,178 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:40,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-16 04:43:40,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:40,385 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:40,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:40,385 INFO L85 PathProgramCache]: Analyzing trace with hash -132253258, now seen corresponding path program 4 times [2023-12-16 04:43:40,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:40,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463296023] [2023-12-16 04:43:40,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:40,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:40,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:40,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:40,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 04:43:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-16 04:43:40,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:40,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463296023] [2023-12-16 04:43:40,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463296023] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:40,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229103081] [2023-12-16 04:43:40,466 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 04:43:40,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:40,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:40,481 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:43:40,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-16 04:43:40,895 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 04:43:40,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:43:40,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 04:43:40,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:40,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 04:43:40,915 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:43:40,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229103081] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:43:40,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 04:43:40,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-12-16 04:43:40,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081586764] [2023-12-16 04:43:40,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:43:40,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:43:40,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:40,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:43:40,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:43:40,916 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 04:43:40,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:40,937 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2023-12-16 04:43:40,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:43:40,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-12-16 04:43:40,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:40,938 INFO L225 Difference]: With dead ends: 59 [2023-12-16 04:43:40,938 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 04:43:40,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:43:40,939 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:40,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:43:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 04:43:40,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-16 04:43:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:43:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2023-12-16 04:43:40,945 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 34 [2023-12-16 04:43:40,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:40,945 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2023-12-16 04:43:40,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 04:43:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2023-12-16 04:43:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 04:43:40,946 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:40,946 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:40,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-16 04:43:41,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-16 04:43:41,157 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:41,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash 573893716, now seen corresponding path program 2 times [2023-12-16 04:43:41,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:41,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394404134] [2023-12-16 04:43:41,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:41,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:41,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 04:43:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:41,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 04:43:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-16 04:43:41,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:41,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394404134] [2023-12-16 04:43:41,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394404134] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:41,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625204741] [2023-12-16 04:43:41,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 04:43:41,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:41,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:41,258 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:43:41,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-16 04:43:41,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 04:43:41,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:43:41,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 04:43:41,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 04:43:41,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:43:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 04:43:41,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625204741] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:43:41,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:43:41,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2023-12-16 04:43:41,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515677022] [2023-12-16 04:43:41,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:43:41,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:43:41,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:41,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:43:41,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:43:41,491 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 04:43:41,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:41,551 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2023-12-16 04:43:41,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:43:41,551 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2023-12-16 04:43:41,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:41,551 INFO L225 Difference]: With dead ends: 32 [2023-12-16 04:43:41,551 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 04:43:41,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:43:41,552 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:41,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 49 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:43:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 04:43:41,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 04:43:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:43:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 04:43:41,553 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2023-12-16 04:43:41,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:41,553 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 04:43:41,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 04:43:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 04:43:41,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 04:43:41,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:43:41,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-16 04:43:41,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-16 04:43:41,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 04:43:42,090 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 620 639) no Hoare annotation was computed. [2023-12-16 04:43:42,090 INFO L895 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse4 (= (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 4) 2)) (.cse5 (= 3 |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse0 (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0)) (.cse7 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse1 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|) 0)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse8 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse1) .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) .cse6 (not .cse7) .cse8) (and .cse0 .cse7 .cse3 .cse4 .cse5 (not (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 0) |ULTIMATE.start_main_~s~0#1.base|)) .cse6 (= |ULTIMATE.start_sll_circular_update_at_~index#1| 1) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 0) 0) .cse8) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 (= 2 |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse7 .cse2 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse1)) (= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) .cse6 .cse8))) [2023-12-16 04:43:42,091 INFO L899 garLoopResultBuilder]: For program point L614-3(lines 614 617) no Hoare annotation was computed. [2023-12-16 04:43:42,091 INFO L899 garLoopResultBuilder]: For program point L631(lines 631 633) no Hoare annotation was computed. [2023-12-16 04:43:42,091 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2023-12-16 04:43:42,091 INFO L899 garLoopResultBuilder]: For program point L598-3(lines 598 602) no Hoare annotation was computed. [2023-12-16 04:43:42,091 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse10 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|) 0))) (let ((.cse0 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse1 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse10))) (.cse2 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse5 (= (select (select |#memory_int#1| .cse10) 4) 3)) (.cse6 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse9 (select (select |#memory_int#1| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 4)) (.cse8 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse4 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 0))) (and (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 0) 0) .cse0 .cse1 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) .cse2 .cse3 (not (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| .cse4)) .cse5 .cse6 .cse7 (= (select (select |#memory_int#1| .cse4) 4) 3) .cse8)) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 (= 2 .cse9) (= (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 4) 2) (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse5 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) .cse6 .cse7 .cse8) (and (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (= 3 .cse9) .cse8)))) [2023-12-16 04:43:42,091 INFO L899 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2023-12-16 04:43:42,091 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 04:43:42,091 INFO L895 garLoopResultBuilder]: At program point L625-3(lines 625 628) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|) 0))) (let ((.cse0 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse5 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse2))) (.cse1 (= (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 4) 2)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 (= (select (select |#memory_int#1| .cse2) 4) 3) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse3 .cse4) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse5 .cse3 .cse4) (and .cse0 .cse5 (= |ULTIMATE.start_main_~i~0#1| 1) .cse1 .cse3 .cse4)))) [2023-12-16 04:43:42,091 INFO L899 garLoopResultBuilder]: For program point L625-4(lines 625 628) no Hoare annotation was computed. [2023-12-16 04:43:42,091 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2)) [2023-12-16 04:43:42,091 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2023-12-16 04:43:42,091 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 637) no Hoare annotation was computed. [2023-12-16 04:43:42,091 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) .cse0 (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) .cse1 (not .cse2)) (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) .cse0 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) .cse2 .cse1))) [2023-12-16 04:43:42,091 INFO L899 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2023-12-16 04:43:42,092 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 04:43:42,092 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2023-12-16 04:43:42,092 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~len#1| 2) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2)) [2023-12-16 04:43:42,092 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2023-12-16 04:43:42,092 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 620 639) no Hoare annotation was computed. [2023-12-16 04:43:42,092 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2023-12-16 04:43:42,092 INFO L895 garLoopResultBuilder]: At program point L629-3(lines 629 634) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|) 0))) (let ((.cse1 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse3 (= (select (select |#memory_int#1| .cse2) 4) 3)) (.cse0 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse0) (and .cse1 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse2)) (= |ULTIMATE.start_main_~i~0#1| 1) .cse3 .cse0 .cse4) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 (= (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 4) 2) .cse3 .cse0 .cse4)))) [2023-12-16 04:43:42,092 INFO L899 garLoopResultBuilder]: For program point L629-4(lines 629 634) no Hoare annotation was computed. [2023-12-16 04:43:42,092 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-16 04:43:42,092 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-16 04:43:42,092 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) [2023-12-16 04:43:42,092 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-12-16 04:43:42,094 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1] [2023-12-16 04:43:42,095 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:43:42,104 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][0] could not be translated [2023-12-16 04:43:42,104 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][0] could not be translated [2023-12-16 04:43:42,105 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-16 04:43:42,106 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-16 04:43:42,106 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-16 04:43:42,106 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated [2023-12-16 04:43:42,106 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-16 04:43:42,106 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated [2023-12-16 04:43:42,106 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated [2023-12-16 04:43:42,107 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 04:43:42,107 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 04:43:42,107 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-16 04:43:42,107 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-16 04:43:42,107 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated [2023-12-16 04:43:42,107 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 04:43:42,107 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 04:43:42,107 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 04:43:42,108 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated [2023-12-16 04:43:42,108 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated [2023-12-16 04:43:42,108 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated [2023-12-16 04:43:42,108 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 04:43:42,108 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 04:43:42,108 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-16 04:43:42,108 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-16 04:43:42,109 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-16 04:43:42,109 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated [2023-12-16 04:43:42,109 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated [2023-12-16 04:43:42,109 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-16 04:43:42,109 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-16 04:43:42,109 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-16 04:43:42,109 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-16 04:43:42,109 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated [2023-12-16 04:43:42,110 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated [2023-12-16 04:43:42,110 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-16 04:43:42,110 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-16 04:43:42,122 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 04:43:42,122 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated [2023-12-16 04:43:42,122 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated [2023-12-16 04:43:42,122 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 04:43:42,122 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][0]][4] could not be translated [2023-12-16 04:43:42,122 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-16 04:43:42,122 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][4] could not be translated [2023-12-16 04:43:42,122 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated [2023-12-16 04:43:42,122 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated [2023-12-16 04:43:42,123 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 04:43:42,123 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-16 04:43:42,123 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-16 04:43:42,123 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated [2023-12-16 04:43:42,123 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-16 04:43:42,123 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][4] could not be translated [2023-12-16 04:43:42,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:43:42 BoogieIcfgContainer [2023-12-16 04:43:42,123 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:43:42,124 INFO L158 Benchmark]: Toolchain (without parser) took 14452.22ms. Allocated memory was 219.2MB in the beginning and 326.1MB in the end (delta: 107.0MB). Free memory was 164.5MB in the beginning and 196.8MB in the end (delta: -32.3MB). Peak memory consumption was 75.2MB. Max. memory is 8.0GB. [2023-12-16 04:43:42,124 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 154.1MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:43:42,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.78ms. Allocated memory is still 219.2MB. Free memory was 164.5MB in the beginning and 146.1MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 04:43:42,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.88ms. Allocated memory is still 219.2MB. Free memory was 146.1MB in the beginning and 144.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 04:43:42,124 INFO L158 Benchmark]: Boogie Preprocessor took 51.59ms. Allocated memory is still 219.2MB. Free memory was 144.0MB in the beginning and 141.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:43:42,124 INFO L158 Benchmark]: RCFGBuilder took 336.81ms. Allocated memory is still 219.2MB. Free memory was 140.9MB in the beginning and 123.6MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 04:43:42,125 INFO L158 Benchmark]: TraceAbstraction took 13675.48ms. Allocated memory was 219.2MB in the beginning and 326.1MB in the end (delta: 107.0MB). Free memory was 123.1MB in the beginning and 196.8MB in the end (delta: -73.7MB). Peak memory consumption was 34.3MB. Max. memory is 8.0GB. [2023-12-16 04:43:42,125 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.43ms. Allocated memory is still 154.1MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 342.78ms. Allocated memory is still 219.2MB. Free memory was 164.5MB in the beginning and 146.1MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.88ms. Allocated memory is still 219.2MB. Free memory was 146.1MB in the beginning and 144.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.59ms. Allocated memory is still 219.2MB. Free memory was 144.0MB in the beginning and 141.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 336.81ms. Allocated memory is still 219.2MB. Free memory was 140.9MB in the beginning and 123.6MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 13675.48ms. Allocated memory was 219.2MB in the beginning and 326.1MB in the end (delta: 107.0MB). Free memory was 123.1MB in the beginning and 196.8MB in the end (delta: -73.7MB). Peak memory consumption was 34.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][4] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 637]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 424 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 421 mSDsluCounter, 1546 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 253 IncrementalHoareTripleChecker+Unchecked, 1326 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2135 IncrementalHoareTripleChecker+Invalid, 2441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 220 mSDtfsCounter, 2135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 637 GetRequests, 427 SyntacticMatches, 14 SemanticMatches, 196 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=10, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 82 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 27 NumberOfFragments, 562 HoareAnnotationTreeSize, 11 FormulaSimplifications, 4400 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FormulaSimplificationsInter, 48 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 628 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 806 ConstructedInterpolants, 23 QuantifiedInterpolants, 4187 SizeOfPredicates, 64 NumberOfNonLiveVariables, 2792 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 275/387 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: (((len <= 1) && (len == 2)) || ((2 == len) && (len == 2))) - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: ((((2 <= i) && (len == 2)) || ((i == 1) && (len == 2))) || ((i == 0) && (len == 2))) - InvariantResult [Line: 614]: Loop Invariant Derived loop invariant: ((((3 == data) && (index <= 0)) || ((3 == data) && (index == 1))) || ((2 == data) && (index == 0))) - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: ((((2 <= i) && (len == 2)) || ((i == 0) && (len == 2))) || ((i == 1) && (len == 2))) - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: (((index == 1) || (index == 0)) || (index <= 0)) RESULT: Ultimate proved your program to be correct! [2023-12-16 04:43:42,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...