/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/dll2n_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:54:33,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:54:33,130 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-15 21:54:33,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:54:33,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:54:33,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:54:33,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:54:33,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:54:33,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:54:33,155 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:54:33,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:54:33,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:54:33,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:54:33,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:54:33,156 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:54:33,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:54:33,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:54:33,157 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:54:33,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:54:33,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:54:33,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:54:33,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:54:33,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:54:33,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:54:33,159 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:54:33,160 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:54:33,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:54:33,160 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:54:33,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:54:33,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:54:33,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:54:33,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:54:33,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:54:33,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:54:33,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:54:33,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:54:33,163 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:54:33,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:54:33,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:54:33,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:54:33,164 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:54:33,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:54:33,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:54:33,164 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:54:33,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:54:33,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:54:33,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:54:33,372 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:54:33,373 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:54:33,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_update_all.i [2023-12-15 21:54:34,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:54:34,731 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:54:34,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all.i [2023-12-15 21:54:34,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d30177d9/5fef90c2f0644530842086cef1c0cf2e/FLAG7c234901f [2023-12-15 21:54:34,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d30177d9/5fef90c2f0644530842086cef1c0cf2e [2023-12-15 21:54:34,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:54:34,764 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:54:34,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:54:34,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:54:34,771 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:54:34,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:54:34" (1/1) ... [2023-12-15 21:54:34,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57296269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:34, skipping insertion in model container [2023-12-15 21:54:34,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:54:34" (1/1) ... [2023-12-15 21:54:34,810 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:54:35,040 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all.i[24455,24468] [2023-12-15 21:54:35,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:54:35,055 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:54:35,119 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all.i[24455,24468] [2023-12-15 21:54:35,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:54:35,162 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:54:35,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:35 WrapperNode [2023-12-15 21:54:35,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:54:35,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:54:35,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:54:35,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:54:35,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:35" (1/1) ... [2023-12-15 21:54:35,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:35" (1/1) ... [2023-12-15 21:54:35,225 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 115 [2023-12-15 21:54:35,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:54:35,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:54:35,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:54:35,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:54:35,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:35" (1/1) ... [2023-12-15 21:54:35,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:35" (1/1) ... [2023-12-15 21:54:35,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:35" (1/1) ... [2023-12-15 21:54:35,254 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 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-15 21:54:35,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:35" (1/1) ... [2023-12-15 21:54:35,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:35" (1/1) ... [2023-12-15 21:54:35,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:35" (1/1) ... [2023-12-15 21:54:35,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:35" (1/1) ... [2023-12-15 21:54:35,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:35" (1/1) ... [2023-12-15 21:54:35,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:35" (1/1) ... [2023-12-15 21:54:35,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:54:35,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:54:35,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:54:35,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:54:35,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:35" (1/1) ... [2023-12-15 21:54:35,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:54:35,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:35,308 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-15 21:54:35,313 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-15 21:54:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-15 21:54:35,336 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-15 21:54:35,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:54:35,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:54:35,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:54:35,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:54:35,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:54:35,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:54:35,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:54:35,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:54:35,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:54:35,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:54:35,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 21:54:35,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:54:35,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:54:35,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:54:35,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:54:35,436 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:54:35,440 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:54:35,467 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-15 21:54:35,581 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:54:35,608 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:54:35,609 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-15 21:54:35,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:54:35 BoogieIcfgContainer [2023-12-15 21:54:35,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:54:35,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:54:35,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:54:35,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:54:35,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:54:34" (1/3) ... [2023-12-15 21:54:35,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746bfa31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:54:35, skipping insertion in model container [2023-12-15 21:54:35,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:35" (2/3) ... [2023-12-15 21:54:35,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746bfa31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:54:35, skipping insertion in model container [2023-12-15 21:54:35,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:54:35" (3/3) ... [2023-12-15 21:54:35,634 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2023-12-15 21:54:35,646 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:54:35,646 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:54:35,677 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:54:35,683 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;@54572b2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:54:35,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:54:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:35,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-15 21:54:35,691 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:35,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:35,693 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:35,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:35,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1931789620, now seen corresponding path program 1 times [2023-12-15 21:54:35,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:35,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37712283] [2023-12-15 21:54:35,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:35,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:35,889 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-15 21:54:35,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:35,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37712283] [2023-12-15 21:54:35,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37712283] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:35,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:35,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:54:35,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775817734] [2023-12-15 21:54:35,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:35,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:54:35,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:35,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:54:35,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:54:35,929 INFO L87 Difference]: Start difference. First operand has 25 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:35,979 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. [2023-12-15 21:54:35,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:54:35,982 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-15 21:54:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:35,988 INFO L225 Difference]: With dead ends: 41 [2023-12-15 21:54:35,989 INFO L226 Difference]: Without dead ends: 17 [2023-12-15 21:54:35,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:54:35,997 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:35,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:36,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-15 21:54:36,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-15 21:54:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2023-12-15 21:54:36,028 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 10 [2023-12-15 21:54:36,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:36,028 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2023-12-15 21:54:36,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2023-12-15 21:54:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-15 21:54:36,029 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:36,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:36,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:54:36,029 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:36,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:36,030 INFO L85 PathProgramCache]: Analyzing trace with hash 887365988, now seen corresponding path program 1 times [2023-12-15 21:54:36,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:36,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987528333] [2023-12-15 21:54:36,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:36,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:36,136 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-15 21:54:36,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:36,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987528333] [2023-12-15 21:54:36,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987528333] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:36,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:36,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:54:36,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720307027] [2023-12-15 21:54:36,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:36,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:54:36,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:36,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:54:36,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:54:36,139 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:36,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:36,165 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2023-12-15 21:54:36,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:54:36,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-15 21:54:36,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:36,166 INFO L225 Difference]: With dead ends: 33 [2023-12-15 21:54:36,166 INFO L226 Difference]: Without dead ends: 22 [2023-12-15 21:54:36,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 21:54:36,167 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:36,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 29 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:36,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-15 21:54:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2023-12-15 21:54:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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-15 21:54:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2023-12-15 21:54:36,172 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 10 [2023-12-15 21:54:36,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:36,172 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2023-12-15 21:54:36,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-15 21:54:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2023-12-15 21:54:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-15 21:54:36,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:36,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:36,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:54:36,174 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:36,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:36,174 INFO L85 PathProgramCache]: Analyzing trace with hash 506733128, now seen corresponding path program 1 times [2023-12-15 21:54:36,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:36,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42372469] [2023-12-15 21:54:36,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:36,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:36,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:36,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42372469] [2023-12-15 21:54:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42372469] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:36,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:36,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:54:36,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632728024] [2023-12-15 21:54:36,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:36,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:54:36,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:36,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:54:36,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:54:36,294 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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-15 21:54:36,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:36,317 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-12-15 21:54:36,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:54:36,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-15 21:54:36,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:36,318 INFO L225 Difference]: With dead ends: 38 [2023-12-15 21:54:36,319 INFO L226 Difference]: Without dead ends: 22 [2023-12-15 21:54:36,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 21:54:36,320 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:36,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 28 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:36,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-15 21:54:36,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2023-12-15 21:54:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-15 21:54:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-12-15 21:54:36,324 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 15 [2023-12-15 21:54:36,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:36,325 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-12-15 21:54:36,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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-15 21:54:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-12-15 21:54:36,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-15 21:54:36,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:36,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:36,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:54:36,326 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:36,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:36,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1207797706, now seen corresponding path program 1 times [2023-12-15 21:54:36,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:36,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280809286] [2023-12-15 21:54:36,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:36,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:36,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:36,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280809286] [2023-12-15 21:54:36,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280809286] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:36,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722983319] [2023-12-15 21:54:36,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:36,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:36,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:36,468 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-15 21:54:36,479 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-15 21:54:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:36,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 21:54:36,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:36,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:36,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:36,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722983319] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:36,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:36,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-12-15 21:54:36,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364716093] [2023-12-15 21:54:36,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:36,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:54:36,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:36,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:54:36,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:54:36,693 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:36,729 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2023-12-15 21:54:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:54:36,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-15 21:54:36,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:36,730 INFO L225 Difference]: With dead ends: 34 [2023-12-15 21:54:36,730 INFO L226 Difference]: Without dead ends: 23 [2023-12-15 21:54:36,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:54:36,742 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:36,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 39 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:36,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-15 21:54:36,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-15 21:54:36,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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-15 21:54:36,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-12-15 21:54:36,748 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 15 [2023-12-15 21:54:36,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:36,749 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-12-15 21:54:36,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:36,749 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-12-15 21:54:36,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-15 21:54:36,750 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:36,750 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:36,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 21:54:36,957 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-15 21:54:36,957 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:36,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:36,958 INFO L85 PathProgramCache]: Analyzing trace with hash -820458590, now seen corresponding path program 1 times [2023-12-15 21:54:36,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:36,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94976623] [2023-12-15 21:54:36,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:36,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:37,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:37,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94976623] [2023-12-15 21:54:37,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94976623] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:37,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:37,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:54:37,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436645004] [2023-12-15 21:54:37,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:37,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:54:37,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:37,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:54:37,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:54:37,087 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-15 21:54:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:37,119 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2023-12-15 21:54:37,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:54:37,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-15 21:54:37,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:37,121 INFO L225 Difference]: With dead ends: 39 [2023-12-15 21:54:37,121 INFO L226 Difference]: Without dead ends: 32 [2023-12-15 21:54:37,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:54:37,122 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:37,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 27 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-15 21:54:37,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2023-12-15 21:54:37,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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-15 21:54:37,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-12-15 21:54:37,130 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 20 [2023-12-15 21:54:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:37,131 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-12-15 21:54:37,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-15 21:54:37,131 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-12-15 21:54:37,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 21:54:37,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:37,132 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:37,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:54:37,133 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:37,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:37,134 INFO L85 PathProgramCache]: Analyzing trace with hash 707043052, now seen corresponding path program 1 times [2023-12-15 21:54:37,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:37,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915420480] [2023-12-15 21:54:37,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:37,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:37,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:37,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915420480] [2023-12-15 21:54:37,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915420480] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:37,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454745948] [2023-12-15 21:54:37,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:37,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:37,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:37,281 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-15 21:54:37,303 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-15 21:54:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:37,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-15 21:54:37,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:37,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:37,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454745948] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:37,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:37,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2023-12-15 21:54:37,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733591249] [2023-12-15 21:54:37,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:37,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:54:37,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:37,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:54:37,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:54:37,575 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:37,638 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2023-12-15 21:54:37,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:54:37,639 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-15 21:54:37,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:37,639 INFO L225 Difference]: With dead ends: 41 [2023-12-15 21:54:37,640 INFO L226 Difference]: Without dead ends: 34 [2023-12-15 21:54:37,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:54:37,641 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 43 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:37,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 41 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:37,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-15 21:54:37,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2023-12-15 21:54:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-12-15 21:54:37,646 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 23 [2023-12-15 21:54:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:37,646 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-12-15 21:54:37,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-12-15 21:54:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 21:54:37,647 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:37,647 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:37,657 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-15 21:54:37,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-15 21:54:37,855 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:37,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:37,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1329958754, now seen corresponding path program 2 times [2023-12-15 21:54:37,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:37,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43491767] [2023-12-15 21:54:37,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:37,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:37,982 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:37,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:37,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43491767] [2023-12-15 21:54:37,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43491767] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:37,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669432339] [2023-12-15 21:54:37,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 21:54:37,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:37,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:37,986 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-15 21:54:38,007 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-15 21:54:38,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 21:54:38,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:54:38,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 21:54:38,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:38,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:38,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669432339] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:38,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:38,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-12-15 21:54:38,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594558817] [2023-12-15 21:54:38,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:38,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:54:38,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:38,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:54:38,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:54:38,193 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-15 21:54:38,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:38,247 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2023-12-15 21:54:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:54:38,249 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-15 21:54:38,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:38,250 INFO L225 Difference]: With dead ends: 44 [2023-12-15 21:54:38,250 INFO L226 Difference]: Without dead ends: 34 [2023-12-15 21:54:38,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:54:38,251 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:38,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 60 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:38,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-15 21:54:38,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2023-12-15 21:54:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-12-15 21:54:38,261 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 26 [2023-12-15 21:54:38,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:38,261 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-12-15 21:54:38,261 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), 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-15 21:54:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-12-15 21:54:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-15 21:54:38,262 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:38,262 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:38,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 21:54:38,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:38,469 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:38,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:38,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1493860792, now seen corresponding path program 1 times [2023-12-15 21:54:38,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:38,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990866020] [2023-12-15 21:54:38,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:38,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:39,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:39,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990866020] [2023-12-15 21:54:39,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990866020] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:39,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908993171] [2023-12-15 21:54:39,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:39,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:39,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:39,488 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-15 21:54:39,490 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-15 21:54:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:39,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 78 conjunts are in the unsatisfiable core [2023-12-15 21:54:39,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:39,672 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-15 21:54:39,740 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:54:39,740 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-15 21:54:39,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-12-15 21:54:39,835 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:54:39,835 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 32 treesize of output 31 [2023-12-15 21:54:40,049 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-15 21:54:40,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2023-12-15 21:54:40,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-15 21:54:40,208 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-15 21:54:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:40,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:40,430 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_404) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2023-12-15 21:54:40,436 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_404) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2023-12-15 21:54:40,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:40,446 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 27 treesize of output 28 [2023-12-15 21:54:40,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:40,456 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 48 treesize of output 51 [2023-12-15 21:54:40,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-12-15 21:54:40,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:40,709 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 2 case distinctions, treesize of input 28 treesize of output 34 [2023-12-15 21:54:40,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:40,719 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 49 treesize of output 31 [2023-12-15 21:54:40,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-15 21:54:40,823 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-15 21:54:40,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908993171] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:40,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:40,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 45 [2023-12-15 21:54:40,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340860238] [2023-12-15 21:54:40,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:40,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-15 21:54:40,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:40,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-15 21:54:40,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1638, Unknown=14, NotChecked=166, Total=1980 [2023-12-15 21:54:40,828 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 45 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 45 states have internal predecessors, (74), 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-15 21:54:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:41,623 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2023-12-15 21:54:41,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-15 21:54:41,624 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 45 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-15 21:54:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:41,625 INFO L225 Difference]: With dead ends: 60 [2023-12-15 21:54:41,625 INFO L226 Difference]: Without dead ends: 58 [2023-12-15 21:54:41,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=342, Invalid=2622, Unknown=14, NotChecked=214, Total=3192 [2023-12-15 21:54:41,627 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 75 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:41,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 206 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 634 Invalid, 0 Unknown, 136 Unchecked, 0.4s Time] [2023-12-15 21:54:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-15 21:54:41,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2023-12-15 21:54:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:41,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2023-12-15 21:54:41,635 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 27 [2023-12-15 21:54:41,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:41,635 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2023-12-15 21:54:41,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 45 states have internal predecessors, (74), 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-15 21:54:41,636 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2023-12-15 21:54:41,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-15 21:54:41,636 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:41,636 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:41,644 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-15 21:54:41,844 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-15 21:54:41,844 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:41,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:41,845 INFO L85 PathProgramCache]: Analyzing trace with hash -934301861, now seen corresponding path program 1 times [2023-12-15 21:54:41,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:41,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317682175] [2023-12-15 21:54:41,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:41,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:41,925 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-15 21:54:41,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:41,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317682175] [2023-12-15 21:54:41,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317682175] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:41,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:41,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:54:41,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156861094] [2023-12-15 21:54:41,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:41,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:54:41,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:41,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:54:41,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:54:41,927 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:41,956 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2023-12-15 21:54:41,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:54:41,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-15 21:54:41,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:41,958 INFO L225 Difference]: With dead ends: 52 [2023-12-15 21:54:41,958 INFO L226 Difference]: Without dead ends: 46 [2023-12-15 21:54:41,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:54:41,960 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:41,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:41,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-15 21:54:41,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2023-12-15 21:54:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:41,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2023-12-15 21:54:41,974 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 28 [2023-12-15 21:54:41,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:41,975 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-12-15 21:54:41,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:41,975 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2023-12-15 21:54:41,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-15 21:54:41,979 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:41,979 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] [2023-12-15 21:54:41,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:54:41,979 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:41,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:41,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2015110622, now seen corresponding path program 2 times [2023-12-15 21:54:41,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:41,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725052779] [2023-12-15 21:54:41,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:41,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:42,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:42,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725052779] [2023-12-15 21:54:42,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725052779] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:42,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36741246] [2023-12-15 21:54:42,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 21:54:42,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:42,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:42,087 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-15 21:54:42,096 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-15 21:54:42,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 21:54:42,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:54:42,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 21:54:42,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:42,247 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:42,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36741246] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:42,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:42,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2023-12-15 21:54:42,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808213449] [2023-12-15 21:54:42,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:42,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:54:42,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:42,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:54:42,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:54:42,274 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-15 21:54:42,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:42,334 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2023-12-15 21:54:42,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:54:42,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-15 21:54:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:42,337 INFO L225 Difference]: With dead ends: 68 [2023-12-15 21:54:42,337 INFO L226 Difference]: Without dead ends: 52 [2023-12-15 21:54:42,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:54:42,338 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:42,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 80 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:42,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-15 21:54:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2023-12-15 21:54:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 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-15 21:54:42,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2023-12-15 21:54:42,357 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 28 [2023-12-15 21:54:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:42,358 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2023-12-15 21:54:42,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-15 21:54:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2023-12-15 21:54:42,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-15 21:54:42,361 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:42,361 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:42,370 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-15 21:54:42,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-15 21:54:42,570 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:42,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:42,570 INFO L85 PathProgramCache]: Analyzing trace with hash 478338447, now seen corresponding path program 1 times [2023-12-15 21:54:42,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:42,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814625389] [2023-12-15 21:54:42,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:42,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-15 21:54:42,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:42,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814625389] [2023-12-15 21:54:42,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814625389] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:42,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575651706] [2023-12-15 21:54:42,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:42,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:42,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:42,650 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-15 21:54:42,673 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-15 21:54:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:42,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 21:54:42,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-15 21:54:42,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-15 21:54:42,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575651706] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:42,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:42,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-12-15 21:54:42,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864956585] [2023-12-15 21:54:42,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:42,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:54:42,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:42,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:54:42,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:54:42,841 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-15 21:54:42,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:42,886 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2023-12-15 21:54:42,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:54:42,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-15 21:54:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:42,887 INFO L225 Difference]: With dead ends: 52 [2023-12-15 21:54:42,887 INFO L226 Difference]: Without dead ends: 46 [2023-12-15 21:54:42,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:54:42,888 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:42,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 48 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:42,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-15 21:54:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2023-12-15 21:54:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2023-12-15 21:54:42,898 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 31 [2023-12-15 21:54:42,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:42,898 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2023-12-15 21:54:42,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-15 21:54:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2023-12-15 21:54:42,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-15 21:54:42,899 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:42,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:42,908 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-15 21:54:43,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:43,105 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:43,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:43,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1944243812, now seen corresponding path program 1 times [2023-12-15 21:54:43,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:43,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364758403] [2023-12-15 21:54:43,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:43,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:44,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:44,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364758403] [2023-12-15 21:54:44,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364758403] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:44,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231228467] [2023-12-15 21:54:44,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:44,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:44,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:44,167 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-15 21:54:44,173 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-15 21:54:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:44,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 88 conjunts are in the unsatisfiable core [2023-12-15 21:54:44,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:44,341 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-15 21:54:44,404 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:54:44,405 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-15 21:54:44,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-15 21:54:44,491 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:54:44,491 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-15 21:54:44,650 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-15 21:54:44,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:44,655 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-15 21:54:44,828 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:54:44,828 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 64 treesize of output 57 [2023-12-15 21:54:44,833 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 23 treesize of output 15 [2023-12-15 21:54:44,835 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 32 treesize of output 19 [2023-12-15 21:54:45,058 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 31 treesize of output 19 [2023-12-15 21:54:45,064 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 19 treesize of output 11 [2023-12-15 21:54:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:45,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:45,278 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 86 treesize of output 64 [2023-12-15 21:54:45,290 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_776 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_776) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) (= |c_ULTIMATE.start_dll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_777 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_dll_update_at_~head#1.base|)))) is different from false [2023-12-15 21:54:45,397 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_777 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_777) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_776 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_776) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2023-12-15 21:54:45,405 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 215 treesize of output 191 [2023-12-15 21:54:45,410 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 93 treesize of output 85 [2023-12-15 21:54:45,414 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 85 treesize of output 81 [2023-12-15 21:54:45,444 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_773 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_773) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_773 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_773))))) is different from false [2023-12-15 21:54:45,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:45,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2023-12-15 21:54:45,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2023-12-15 21:54:45,728 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:45,730 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 38 treesize of output 30 [2023-12-15 21:54:45,733 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:45,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-15 21:54:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-15 21:54:45,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231228467] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:45,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:45,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 52 [2023-12-15 21:54:45,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776521977] [2023-12-15 21:54:45,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:45,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-15 21:54:45,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:45,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-15 21:54:45,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2149, Unknown=30, NotChecked=288, Total=2652 [2023-12-15 21:54:45,839 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 52 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 52 states have internal predecessors, (90), 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-15 21:54:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:46,665 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2023-12-15 21:54:46,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-15 21:54:46,666 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 52 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-15 21:54:46,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:46,667 INFO L225 Difference]: With dead ends: 77 [2023-12-15 21:54:46,667 INFO L226 Difference]: Without dead ends: 75 [2023-12-15 21:54:46,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=332, Invalid=3189, Unknown=31, NotChecked=354, Total=3906 [2023-12-15 21:54:46,669 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 100 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:46,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 271 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 735 Invalid, 0 Unknown, 202 Unchecked, 0.5s Time] [2023-12-15 21:54:46,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-15 21:54:46,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2023-12-15 21:54:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 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-15 21:54:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2023-12-15 21:54:46,679 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 32 [2023-12-15 21:54:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:46,680 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2023-12-15 21:54:46,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 52 states have internal predecessors, (90), 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-15 21:54:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2023-12-15 21:54:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-15 21:54:46,680 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:46,680 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:46,689 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-15 21:54:46,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:46,881 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:46,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:46,882 INFO L85 PathProgramCache]: Analyzing trace with hash -478685482, now seen corresponding path program 3 times [2023-12-15 21:54:46,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:46,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058084358] [2023-12-15 21:54:46,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:46,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-15 21:54:46,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:46,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058084358] [2023-12-15 21:54:46,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058084358] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:46,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613859551] [2023-12-15 21:54:46,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-15 21:54:46,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:46,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:46,976 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-15 21:54:46,980 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-15 21:54:47,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-15 21:54:47,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:54:47,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 21:54:47,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-15 21:54:47,314 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-15 21:54:47,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613859551] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:47,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:47,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2023-12-15 21:54:47,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691342607] [2023-12-15 21:54:47,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:47,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:54:47,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:47,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:54:47,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:54:47,350 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 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-15 21:54:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:47,402 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2023-12-15 21:54:47,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:54:47,402 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-15 21:54:47,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:47,403 INFO L225 Difference]: With dead ends: 60 [2023-12-15 21:54:47,403 INFO L226 Difference]: Without dead ends: 34 [2023-12-15 21:54:47,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:54:47,404 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:47,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 49 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:47,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-15 21:54:47,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-15 21:54:47,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 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-15 21:54:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2023-12-15 21:54:47,408 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 32 [2023-12-15 21:54:47,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:47,408 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2023-12-15 21:54:47,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 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-15 21:54:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2023-12-15 21:54:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-15 21:54:47,409 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:47,409 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:47,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-15 21:54:47,616 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,SelfDestructingSolverStorable12 [2023-12-15 21:54:47,616 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:47,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:47,617 INFO L85 PathProgramCache]: Analyzing trace with hash 142669871, now seen corresponding path program 2 times [2023-12-15 21:54:47,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:47,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819720263] [2023-12-15 21:54:47,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:47,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-15 21:54:47,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:47,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819720263] [2023-12-15 21:54:47,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819720263] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:47,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723820988] [2023-12-15 21:54:47,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 21:54:47,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:47,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:47,696 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-15 21:54:47,708 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-15 21:54:47,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 21:54:47,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:54:47,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 21:54:47,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:47,893 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-15 21:54:47,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-15 21:54:47,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723820988] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:47,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:47,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2023-12-15 21:54:47,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006215676] [2023-12-15 21:54:47,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:47,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:54:47,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:47,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:54:47,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:54:47,932 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-15 21:54:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:47,981 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2023-12-15 21:54:47,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:54:47,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-15 21:54:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:47,982 INFO L225 Difference]: With dead ends: 34 [2023-12-15 21:54:47,982 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 21:54:47,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:54:47,983 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:47,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 29 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 21:54:47,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 21:54:47,984 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-15 21:54:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 21:54:47,984 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2023-12-15 21:54:47,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:47,985 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 21:54:47,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-15 21:54:47,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 21:54:47,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 21:54:47,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:54:47,996 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-15 21:54:48,193 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,SelfDestructingSolverStorable13 [2023-12-15 21:54:48,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 21:54:48,464 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-12-15 21:54:48,464 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 572 574) the Hoare annotation is: true [2023-12-15 21:54:48,464 INFO L899 garLoopResultBuilder]: For program point myexitEXIT(lines 572 574) no Hoare annotation was computed. [2023-12-15 21:54:48,464 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 591) no Hoare annotation was computed. [2023-12-15 21:54:48,464 INFO L899 garLoopResultBuilder]: For program point L589-1(lines 589 591) no Hoare annotation was computed. [2023-12-15 21:54:48,464 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 624 643) no Hoare annotation was computed. [2023-12-15 21:54:48,464 INFO L902 garLoopResultBuilder]: At program point L590(line 590) the Hoare annotation is: true [2023-12-15 21:54:48,464 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 21:54:48,464 INFO L895 garLoopResultBuilder]: At program point L633-3(lines 633 638) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse5 (select .cse0 4))) (let ((.cse1 (not (= .cse5 |ULTIMATE.start_main_~s~0#1.base|))) (.cse2 (= (select (select |#memory_int#1| .cse5) (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (= (select .cse0 8) 0) .cse1 .cse2 (= 2 (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 0)) .cse3 .cse4) (and (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse3) (and (= |ULTIMATE.start_main_~i~0#1| 1) .cse1 .cse2 .cse3 .cse4))))) [2023-12-15 21:54:48,465 INFO L899 garLoopResultBuilder]: For program point L633-4(lines 633 638) no Hoare annotation was computed. [2023-12-15 21:54:48,465 INFO L895 garLoopResultBuilder]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse9 (select .cse11 4))) (let ((.cse1 (= 3 |ULTIMATE.start_dll_update_at_~data#1|)) (.cse3 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse6 (= 2 (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 0))) (.cse0 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse2 (= (select .cse11 8) 0)) (.cse4 (= |ULTIMATE.start_dll_update_at_~head#1.offset| 0)) (.cse5 (not (= .cse9 |ULTIMATE.start_main_~s~0#1.base|))) (.cse10 (<= |ULTIMATE.start_dll_update_at_~index#1| 0)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse8 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_dll_update_at_~index#1| 1) .cse6 .cse7 .cse8) (and (= .cse9 |ULTIMATE.start_dll_update_at_~head#1.base|) .cse1 .cse2 .cse3 .cse5 .cse10 .cse6 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_dll_update_at_~head#1.offset|) .cse7 .cse8) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse2 .cse4 .cse5 .cse10 .cse7 (= 2 |ULTIMATE.start_dll_update_at_~data#1|) .cse8))))) [2023-12-15 21:54:48,465 INFO L899 garLoopResultBuilder]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2023-12-15 21:54:48,465 INFO L899 garLoopResultBuilder]: For program point L635(lines 635 637) no Hoare annotation was computed. [2023-12-15 21:54:48,465 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 641) no Hoare annotation was computed. [2023-12-15 21:54:48,465 INFO L895 garLoopResultBuilder]: At program point L611-2(lines 611 614) the Hoare annotation is: (let ((.cse9 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse10 (select .cse9 4))) (let ((.cse2 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse4 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse1 (= |ULTIMATE.start_dll_get_data_at_~head#1.offset| 0)) (.cse8 (select |#memory_int#1| |ULTIMATE.start_dll_get_data_at_~head#1.base|)) (.cse3 (not (= .cse10 |ULTIMATE.start_main_~s~0#1.base|))) (.cse5 (= (select (select |#memory_int#1| .cse10) (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse0 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_get_data_at_~head#1.base|) 4))) (and (= (select (select |#memory_int#1| .cse0) (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_get_data_at_~head#1.base|) 4)) 3) .cse1 .cse2 (not (= .cse0 |ULTIMATE.start_dll_get_data_at_~head#1.base|)) .cse3 .cse4 .cse5 (= |ULTIMATE.start_dll_get_data_at_~index#1| 1) .cse6 .cse7)) (and .cse2 (<= |ULTIMATE.start_dll_get_data_at_~index#1| 0) .cse3 .cse4 .cse5 (= 3 (select .cse8 |ULTIMATE.start_dll_get_data_at_~head#1.offset|)) .cse6 .cse7) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 (= (select .cse9 8) 0) (= 2 (select .cse8 0)) (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse3 .cse5 (= 2 (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 0)) (= |ULTIMATE.start_dll_get_data_at_~index#1| 0) .cse6 .cse7))))) [2023-12-15 21:54:48,465 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 21:54:48,465 INFO L899 garLoopResultBuilder]: For program point L611-3(lines 611 614) no Hoare annotation was computed. [2023-12-15 21:54:48,465 INFO L899 garLoopResultBuilder]: For program point L603(lines 603 609) no Hoare annotation was computed. [2023-12-15 21:54:48,465 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 597) no Hoare annotation was computed. [2023-12-15 21:54:48,465 INFO L899 garLoopResultBuilder]: For program point L595-2(lines 595 597) no Hoare annotation was computed. [2023-12-15 21:54:48,465 INFO L895 garLoopResultBuilder]: At program point L587-2(lines 587 600) the Hoare annotation is: (let ((.cse2 (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (.cse0 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))) (or (and (= 2 |ULTIMATE.start_dll_create_~len#1|) .cse0 .cse1 (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (and .cse2 (<= 1 |ULTIMATE.start_dll_create_~len#1|) .cse0) (let ((.cse3 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_create_~head~0#1.base|))) (and .cse2 (= (select .cse3 8) 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select .cse3 4))) .cse0 .cse1)))) [2023-12-15 21:54:48,465 INFO L899 garLoopResultBuilder]: For program point L587-3(lines 587 600) no Hoare annotation was computed. [2023-12-15 21:54:48,465 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2023-12-15 21:54:48,465 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 624 643) no Hoare annotation was computed. [2023-12-15 21:54:48,466 INFO L895 garLoopResultBuilder]: At program point L629-3(lines 629 632) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse2 (select .cse6 4))) (let ((.cse3 (= 2 (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 0))) (.cse0 (= (select .cse6 8) 0)) (.cse1 (not (= .cse2 |ULTIMATE.start_main_~s~0#1.base|))) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 (= (select (select |#memory_int#1| .cse2) (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse3 .cse4 .cse5) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1) .cse1 .cse3 .cse4 .cse5) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse4 .cse5))))) [2023-12-15 21:54:48,466 INFO L899 garLoopResultBuilder]: For program point L629-4(lines 629 632) no Hoare annotation was computed. [2023-12-15 21:54:48,468 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:48,470 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:54:48,479 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated [2023-12-15 21:54:48,479 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:48,480 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated [2023-12-15 21:54:48,480 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated [2023-12-15 21:54:48,480 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:48,480 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated [2023-12-15 21:54:48,487 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][4]][#memory_$Pointer$#1.offset[~head!base][4]] could not be translated [2023-12-15 21:54:48,487 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:48,487 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][4] could not be translated [2023-12-15 21:54:48,487 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:48,487 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:48,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated [2023-12-15 21:54:48,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:48,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated [2023-12-15 21:54:48,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][~head!offset] could not be translated [2023-12-15 21:54:48,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:48,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated [2023-12-15 21:54:48,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][0] could not be translated [2023-12-15 21:54:48,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:48,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated [2023-12-15 21:54:48,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated [2023-12-15 21:54:48,490 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-15 21:54:48,490 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-15 21:54:48,490 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][8] could not be translated [2023-12-15 21:54:48,491 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-12-15 21:54:48,492 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated [2023-12-15 21:54:48,493 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:48,493 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated [2023-12-15 21:54:48,493 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated [2023-12-15 21:54:48,493 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated [2023-12-15 21:54:48,494 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:48,494 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated [2023-12-15 21:54:48,494 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated [2023-12-15 21:54:48,494 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:48,495 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:48,495 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated [2023-12-15 21:54:48,495 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:48,495 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:48,496 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated [2023-12-15 21:54:48,496 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:48,496 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:48,496 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated [2023-12-15 21:54:48,496 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:48,496 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated [2023-12-15 21:54:48,496 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][4] could not be translated [2023-12-15 21:54:48,496 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:48,497 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:48,497 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated [2023-12-15 21:54:48,497 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:48,497 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:48,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:54:48 BoogieIcfgContainer [2023-12-15 21:54:48,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:54:48,498 INFO L158 Benchmark]: Toolchain (without parser) took 13733.96ms. Allocated memory was 206.6MB in the beginning and 335.5MB in the end (delta: 129.0MB). Free memory was 160.6MB in the beginning and 297.8MB in the end (delta: -137.2MB). Peak memory consumption was 176.7MB. Max. memory is 8.0GB. [2023-12-15 21:54:48,498 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 206.6MB. Free memory is still 163.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:54:48,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.95ms. Allocated memory is still 206.6MB. Free memory was 160.3MB in the beginning and 142.1MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-15 21:54:48,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.11ms. Allocated memory is still 206.6MB. Free memory was 142.1MB in the beginning and 140.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:54:48,499 INFO L158 Benchmark]: Boogie Preprocessor took 47.59ms. Allocated memory is still 206.6MB. Free memory was 140.0MB in the beginning and 137.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:54:48,499 INFO L158 Benchmark]: RCFGBuilder took 334.76ms. Allocated memory is still 206.6MB. Free memory was 137.2MB in the beginning and 121.1MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-15 21:54:48,499 INFO L158 Benchmark]: TraceAbstraction took 12868.72ms. Allocated memory was 206.6MB in the beginning and 335.5MB in the end (delta: 129.0MB). Free memory was 179.8MB in the beginning and 297.8MB in the end (delta: -118.0MB). Peak memory consumption was 195.0MB. Max. memory is 8.0GB. [2023-12-15 21:54:48,500 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.49ms. Allocated memory is still 206.6MB. Free memory is still 163.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 397.95ms. Allocated memory is still 206.6MB. Free memory was 160.3MB in the beginning and 142.1MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.11ms. Allocated memory is still 206.6MB. Free memory was 142.1MB in the beginning and 140.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.59ms. Allocated memory is still 206.6MB. Free memory was 140.0MB in the beginning and 137.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 334.76ms. Allocated memory is still 206.6MB. Free memory was 137.2MB in the beginning and 121.1MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 12868.72ms. Allocated memory was 206.6MB in the beginning and 335.5MB in the end (delta: 129.0MB). Free memory was 179.8MB in the beginning and 297.8MB in the end (delta: -118.0MB). Peak memory consumption was 195.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][4]][#memory_$Pointer$#1.offset[~head!base][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.base[~head!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: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][~head!offset] 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.base[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~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 #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][4]][#memory_$Pointer$#1.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~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: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] 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.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~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: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][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][8] 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.base[~s~0!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: 641]: 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, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 381 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 381 mSDsluCounter, 973 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 338 IncrementalHoareTripleChecker+Unchecked, 764 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1704 IncrementalHoareTripleChecker+Invalid, 2097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 209 mSDtfsCounter, 1704 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 605 GetRequests, 413 SyntacticMatches, 20 SemanticMatches, 172 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=12, InterpolantAutomatonStates: 100, 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, 14 MinimizatonAttempts, 86 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 24 NumberOfFragments, 558 HoareAnnotationTreeSize, 8 FormulaSimplifications, 3203 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FormulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 577 NumberOfCodeBlocks, 576 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 792 ConstructedInterpolants, 18 QuantifiedInterpolants, 3827 SizeOfPredicates, 62 NumberOfNonLiveVariables, 2328 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 32 InterpolantComputations, 5 PerfectInterpolantSequences, 318/455 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: 633]: Loop Invariant Derived loop invariant: ((((i == 0) && (len == 2)) || ((2 <= i) && (len == 2))) || ((i == 1) && (len == 2))) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: (((index == 1) || (index <= 0)) || (index == 0)) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: ((((2 == len) && (len == 2)) || ((1 <= len) && (len == 2))) || (len == 2)) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: ((((2 <= i) && (len == 2)) || ((i == 1) && (len == 2))) || ((i == 0) && (len == 2))) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: ((((3 == data) && (index == 1)) || ((3 == data) && (index <= 0))) || ((index <= 0) && (2 == data))) RESULT: Ultimate proved your program to be correct! [2023-12-15 21:54:48,518 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...