/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/sll2c_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:55:20,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:55:20,721 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:55:20,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:55:20,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:55:20,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:55:20,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:55:20,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:55:20,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:55:20,756 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:55:20,756 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:55:20,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:55:20,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:55:20,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:55:20,758 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:55:20,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:55:20,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:55:20,759 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:55:20,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:55:20,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:55:20,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:55:20,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:55:20,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:55:20,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:55:20,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:55:20,761 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:55:20,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:55:20,761 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:55:20,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:55:20,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:55:20,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:55:20,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:55:20,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:55:20,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:55:20,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:55:20,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:55:20,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:55:20,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:55:20,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:55:20,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:55:20,764 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:55:20,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:55:20,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:55:20,764 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:55:20,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:55:20,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:55:20,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:55:20,967 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:55:20,968 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:55:20,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_update_all_reverse.i [2023-12-15 21:55:21,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:55:22,110 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:55:22,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_update_all_reverse.i [2023-12-15 21:55:22,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db2bed2c6/9e552745ecd04d85874f7479dade1d7b/FLAG2d6e5fa7d [2023-12-15 21:55:22,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db2bed2c6/9e552745ecd04d85874f7479dade1d7b [2023-12-15 21:55:22,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:55:22,134 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:55:22,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:55:22,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:55:22,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:55:22,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:55:22" (1/1) ... [2023-12-15 21:55:22,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3811154a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:22, skipping insertion in model container [2023-12-15 21:55:22,141 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:55:22" (1/1) ... [2023-12-15 21:55:22,179 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:55:22,398 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_update_all_reverse.i[24436,24449] [2023-12-15 21:55:22,405 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:55:22,418 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:55:22,464 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_update_all_reverse.i[24436,24449] [2023-12-15 21:55:22,465 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:55:22,490 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:55:22,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:22 WrapperNode [2023-12-15 21:55:22,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:55:22,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:55:22,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:55:22,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:55:22,496 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:55:22" (1/1) ... [2023-12-15 21:55:22,508 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:55:22" (1/1) ... [2023-12-15 21:55:22,527 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 132 [2023-12-15 21:55:22,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:55:22,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:55:22,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:55:22,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:55:22,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:22" (1/1) ... [2023-12-15 21:55:22,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:22" (1/1) ... [2023-12-15 21:55:22,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:22" (1/1) ... [2023-12-15 21:55:22,563 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2023-12-15 21:55:22,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:22" (1/1) ... [2023-12-15 21:55:22,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:22" (1/1) ... [2023-12-15 21:55:22,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:22" (1/1) ... [2023-12-15 21:55:22,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:22" (1/1) ... [2023-12-15 21:55:22,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:22" (1/1) ... [2023-12-15 21:55:22,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:22" (1/1) ... [2023-12-15 21:55:22,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:55:22,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:55:22,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:55:22,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:55:22,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:22" (1/1) ... [2023-12-15 21:55:22,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:55:22,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:22,624 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:55:22,652 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:55:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:55:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:55:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:55:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:55:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-15 21:55:22,661 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-15 21:55:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:55:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:55:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:55:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:55:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:55:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:55:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 21:55:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:55:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:55:22,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:55:22,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:55:22,775 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:55:22,777 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:55:22,918 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:55:22,939 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:55:22,940 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-15 21:55:22,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:55:22 BoogieIcfgContainer [2023-12-15 21:55:22,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:55:22,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:55:22,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:55:22,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:55:22,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:55:22" (1/3) ... [2023-12-15 21:55:22,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d2f9d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:55:22, skipping insertion in model container [2023-12-15 21:55:22,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:55:22" (2/3) ... [2023-12-15 21:55:22,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d2f9d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:55:22, skipping insertion in model container [2023-12-15 21:55:22,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:55:22" (3/3) ... [2023-12-15 21:55:22,945 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2023-12-15 21:55:22,956 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:55:22,956 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:55:22,987 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:55:22,992 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;@6369bfeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:55:22,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:55:22,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:55:22,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-15 21:55:22,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:22,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:22,999 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:23,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:23,003 INFO L85 PathProgramCache]: Analyzing trace with hash 816945935, now seen corresponding path program 1 times [2023-12-15 21:55:23,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:23,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766320366] [2023-12-15 21:55:23,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:23,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:23,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:23,171 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:55:23,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:23,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766320366] [2023-12-15 21:55:23,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766320366] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:55:23,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:55:23,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:55:23,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364752676] [2023-12-15 21:55:23,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:55:23,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:55:23,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:23,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:55:23,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:55:23,196 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:55:23,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:23,246 INFO L93 Difference]: Finished difference Result 46 states and 72 transitions. [2023-12-15 21:55:23,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:55:23,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-12-15 21:55:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:23,252 INFO L225 Difference]: With dead ends: 46 [2023-12-15 21:55:23,252 INFO L226 Difference]: Without dead ends: 20 [2023-12-15 21:55:23,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:55:23,257 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:23,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:55:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-15 21:55:23,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-15 21:55:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:55:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-12-15 21:55:23,287 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2023-12-15 21:55:23,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:23,288 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-12-15 21:55:23,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:55:23,288 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-12-15 21:55:23,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-15 21:55:23,289 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:23,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:23,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:55:23,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:23,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:23,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1614030004, now seen corresponding path program 1 times [2023-12-15 21:55:23,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:23,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20260052] [2023-12-15 21:55:23,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:23,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:23,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:23,450 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:55:23,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:23,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20260052] [2023-12-15 21:55:23,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20260052] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:55:23,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:55:23,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:55:23,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082532211] [2023-12-15 21:55:23,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:55:23,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:55:23,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:23,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:55:23,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:55:23,453 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:55:23,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:23,482 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2023-12-15 21:55:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:55:23,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-12-15 21:55:23,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:23,483 INFO L225 Difference]: With dead ends: 34 [2023-12-15 21:55:23,483 INFO L226 Difference]: Without dead ends: 23 [2023-12-15 21:55:23,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:55:23,485 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:23,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:55:23,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-15 21:55:23,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-12-15 21:55:23,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:55:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-12-15 21:55:23,493 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 15 [2023-12-15 21:55:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:23,493 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-12-15 21:55:23,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:55:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-12-15 21:55:23,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-15 21:55:23,496 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:23,496 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:23,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:55:23,496 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:23,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:23,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2105803652, now seen corresponding path program 1 times [2023-12-15 21:55:23,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:23,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722355533] [2023-12-15 21:55:23,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:23,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:23,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:23,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:55:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:55:23,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:23,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722355533] [2023-12-15 21:55:23,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722355533] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:23,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085168151] [2023-12-15 21:55:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:23,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:23,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:23,730 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:55:23,754 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:55:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:23,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 21:55:23,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:23,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 21:55:23,910 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:55:23,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085168151] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:55:23,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:55:23,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-12-15 21:55:23,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971600085] [2023-12-15 21:55:23,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:55:23,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:55:23,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:23,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:55:23,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:55:23,912 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:55:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:23,952 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2023-12-15 21:55:23,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:55:23,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2023-12-15 21:55:23,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:23,953 INFO L225 Difference]: With dead ends: 37 [2023-12-15 21:55:23,953 INFO L226 Difference]: Without dead ends: 30 [2023-12-15 21:55:23,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:55:23,957 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:23,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 34 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:55:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-15 21:55:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2023-12-15 21:55:23,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:55:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2023-12-15 21:55:23,965 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 21 [2023-12-15 21:55:23,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:23,966 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-12-15 21:55:23,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:55:23,966 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2023-12-15 21:55:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-15 21:55:23,967 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:23,967 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:23,975 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:55:24,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:24,172 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:24,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:24,173 INFO L85 PathProgramCache]: Analyzing trace with hash 234978919, now seen corresponding path program 1 times [2023-12-15 21:55:24,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:24,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906376537] [2023-12-15 21:55:24,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:24,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:24,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:24,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:55:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 21:55:24,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:24,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906376537] [2023-12-15 21:55:24,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906376537] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:24,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830509757] [2023-12-15 21:55:24,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:24,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:24,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:24,364 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:55:24,368 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:55:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:24,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 21:55:24,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 21:55:24,509 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:55:24,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830509757] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:55:24,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:55:24,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2023-12-15 21:55:24,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675756752] [2023-12-15 21:55:24,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:55:24,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:55:24,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:24,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:55:24,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:55:24,513 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:55:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:24,559 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2023-12-15 21:55:24,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:55:24,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-12-15 21:55:24,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:24,561 INFO L225 Difference]: With dead ends: 41 [2023-12-15 21:55:24,561 INFO L226 Difference]: Without dead ends: 31 [2023-12-15 21:55:24,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:55:24,563 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:24,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 47 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:55:24,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-15 21:55:24,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2023-12-15 21:55:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:55:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-12-15 21:55:24,570 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 24 [2023-12-15 21:55:24,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:24,570 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-12-15 21:55:24,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:55:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-12-15 21:55:24,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-15 21:55:24,571 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:24,571 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:24,588 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:55:24,777 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,SelfDestructingSolverStorable3 [2023-12-15 21:55:24,777 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:24,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash -845260781, now seen corresponding path program 1 times [2023-12-15 21:55:24,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:24,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678708428] [2023-12-15 21:55:24,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:24,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:24,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:24,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:55:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 21:55:24,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:24,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678708428] [2023-12-15 21:55:24,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678708428] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:24,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671226556] [2023-12-15 21:55:24,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:24,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:24,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:24,868 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:55:24,870 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:55:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:24,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-15 21:55:24,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 21:55:25,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:55:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 21:55:25,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671226556] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:55:25,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:55:25,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2023-12-15 21:55:25,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333976506] [2023-12-15 21:55:25,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:55:25,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:55:25,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:25,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:55:25,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:55:25,093 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 21:55:25,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:25,171 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2023-12-15 21:55:25,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:55:25,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-12-15 21:55:25,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:25,172 INFO L225 Difference]: With dead ends: 40 [2023-12-15 21:55:25,172 INFO L226 Difference]: Without dead ends: 33 [2023-12-15 21:55:25,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:55:25,173 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 43 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:25,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 58 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:55:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-15 21:55:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2023-12-15 21:55:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:55:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-12-15 21:55:25,182 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 25 [2023-12-15 21:55:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:25,182 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-12-15 21:55:25,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 21:55:25,182 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-12-15 21:55:25,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-15 21:55:25,183 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:25,183 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:25,190 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:55:25,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:25,390 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:25,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:25,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2126387344, now seen corresponding path program 2 times [2023-12-15 21:55:25,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:25,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642929061] [2023-12-15 21:55:25,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:25,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:25,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:25,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:55:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-15 21:55:25,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:25,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642929061] [2023-12-15 21:55:25,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642929061] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:25,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707707534] [2023-12-15 21:55:25,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 21:55:25,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:25,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:25,507 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:55:25,528 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:55:25,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-15 21:55:25,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:55:25,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 21:55:25,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-15 21:55:25,635 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:55:25,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707707534] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:55:25,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:55:25,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-12-15 21:55:25,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958428418] [2023-12-15 21:55:25,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:55:25,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:55:25,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:25,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:55:25,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:55:25,637 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:55:25,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:25,672 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2023-12-15 21:55:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:55:25,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-12-15 21:55:25,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:25,673 INFO L225 Difference]: With dead ends: 41 [2023-12-15 21:55:25,673 INFO L226 Difference]: Without dead ends: 35 [2023-12-15 21:55:25,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:55:25,674 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:25,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 47 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:55:25,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-15 21:55:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2023-12-15 21:55:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:55:25,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-12-15 21:55:25,679 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 28 [2023-12-15 21:55:25,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:25,679 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-12-15 21:55:25,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:55:25,680 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-12-15 21:55:25,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-15 21:55:25,680 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:25,680 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:25,688 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:55:25,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:25,892 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:25,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:25,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1493478867, now seen corresponding path program 1 times [2023-12-15 21:55:25,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:25,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106370924] [2023-12-15 21:55:25,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:25,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:27,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:27,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:55:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:55:27,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:27,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106370924] [2023-12-15 21:55:27,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106370924] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:27,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4077373] [2023-12-15 21:55:27,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:27,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:27,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:27,192 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:55:27,215 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:55:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:27,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 103 conjunts are in the unsatisfiable core [2023-12-15 21:55:27,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:27,360 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:55:27,509 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:55:27,509 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:55:27,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:55:27,546 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 15 treesize of output 1 [2023-12-15 21:55:27,598 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:55:27,599 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 41 treesize of output 38 [2023-12-15 21:55:27,603 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 16 treesize of output 1 [2023-12-15 21:55:27,755 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:55:27,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 59 [2023-12-15 21:55:27,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-12-15 21:55:27,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-12-15 21:55:27,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:55:27,867 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 37 treesize of output 21 [2023-12-15 21:55:27,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:55:27,872 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 45 treesize of output 25 [2023-12-15 21:55:27,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-15 21:55:27,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-12-15 21:55:27,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-15 21:55:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:55:28,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:55:28,215 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_624 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (or (= (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_626) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_623) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_624)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) (not (= v_ArrVal_623 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_623 .cse0))))))) is different from false [2023-12-15 21:55:28,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:28,392 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 50 treesize of output 51 [2023-12-15 21:55:28,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:28,402 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 104 treesize of output 103 [2023-12-15 21:55:28,412 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 39 treesize of output 23 [2023-12-15 21:55:29,216 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_619 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_624 Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_618))) (= (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_619) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_621) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_18| 4) v_ArrVal_624) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_619 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_DerPreprocessor_1 Int) (v_ArrVal_620 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_619))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_620)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_18| 4) v_DerPreprocessor_1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_619 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_DerPreprocessor_1 Int) (v_ArrVal_620 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_619))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse2 (select (store (select (store .cse3 .cse2 v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_18| 4) v_DerPreprocessor_1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))) is different from false [2023-12-15 21:55:29,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:29,249 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 56 treesize of output 49 [2023-12-15 21:55:29,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:55:29,254 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 40 treesize of output 41 [2023-12-15 21:55:29,256 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 74 treesize of output 66 [2023-12-15 21:55:29,260 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 754 treesize of output 706 [2023-12-15 21:55:29,265 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:55:29,266 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 72 treesize of output 68 [2023-12-15 21:55:29,268 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:55:29,270 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 19 treesize of output 17 [2023-12-15 21:55:29,272 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:55:29,274 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 22 treesize of output 20 [2023-12-15 21:55:29,276 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 14 treesize of output 12 [2023-12-15 21:55:29,284 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-15 21:55:29,284 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 1 [2023-12-15 21:55:29,288 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-15 21:55:29,288 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 1 [2023-12-15 21:55:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-15 21:55:29,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4077373] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:55:29,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:55:29,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 57 [2023-12-15 21:55:29,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815574786] [2023-12-15 21:55:29,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:55:29,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-12-15 21:55:29,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:29,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-12-15 21:55:29,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2731, Unknown=62, NotChecked=214, Total=3192 [2023-12-15 21:55:29,688 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 57 states, 50 states have (on average 1.42) internal successors, (71), 48 states have internal predecessors, (71), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-15 21:55:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:30,979 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2023-12-15 21:55:30,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-15 21:55:30,979 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 50 states have (on average 1.42) internal successors, (71), 48 states have internal predecessors, (71), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2023-12-15 21:55:30,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:30,981 INFO L225 Difference]: With dead ends: 64 [2023-12-15 21:55:30,981 INFO L226 Difference]: Without dead ends: 62 [2023-12-15 21:55:30,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=318, Invalid=4050, Unknown=62, NotChecked=262, Total=4692 [2023-12-15 21:55:30,982 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 158 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:30,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 371 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 841 Invalid, 0 Unknown, 128 Unchecked, 0.6s Time] [2023-12-15 21:55:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-15 21:55:30,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2023-12-15 21:55:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:55:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2023-12-15 21:55:30,989 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 29 [2023-12-15 21:55:30,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:30,989 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2023-12-15 21:55:30,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 50 states have (on average 1.42) internal successors, (71), 48 states have internal predecessors, (71), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-15 21:55:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2023-12-15 21:55:30,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-15 21:55:30,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:30,990 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:30,995 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:55:31,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:31,195 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:31,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash 946814736, now seen corresponding path program 2 times [2023-12-15 21:55:31,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:31,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489820111] [2023-12-15 21:55:31,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:31,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:31,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:31,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:55:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-15 21:55:31,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:31,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489820111] [2023-12-15 21:55:31,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489820111] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:31,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023213646] [2023-12-15 21:55:31,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 21:55:31,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:31,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:31,305 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:55:31,336 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:55:31,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 21:55:31,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:55:31,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 21:55:31,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-15 21:55:31,468 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:55:31,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023213646] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:55:31,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:55:31,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2023-12-15 21:55:31,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153711223] [2023-12-15 21:55:31,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:55:31,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:55:31,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:31,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:55:31,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:55:31,470 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:55:31,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:31,506 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2023-12-15 21:55:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:55:31,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-12-15 21:55:31,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:31,508 INFO L225 Difference]: With dead ends: 53 [2023-12-15 21:55:31,508 INFO L226 Difference]: Without dead ends: 47 [2023-12-15 21:55:31,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:55:31,509 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:31,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 38 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:55:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-15 21:55:31,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-15 21:55:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:55:31,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2023-12-15 21:55:31,519 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 30 [2023-12-15 21:55:31,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:31,520 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2023-12-15 21:55:31,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:55:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2023-12-15 21:55:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-15 21:55:31,524 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:31,524 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:31,531 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:55:31,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:31,730 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:31,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:31,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1174428671, now seen corresponding path program 3 times [2023-12-15 21:55:31,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:31,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340217061] [2023-12-15 21:55:31,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:31,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:31,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:31,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:55:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:31,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 21:55:31,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:31,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340217061] [2023-12-15 21:55:31,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340217061] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:31,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419956557] [2023-12-15 21:55:31,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-15 21:55:31,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:31,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:31,816 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:55:31,843 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:55:32,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-15 21:55:32,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:55:32,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 21:55:32,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-15 21:55:32,117 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:55:32,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419956557] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:55:32,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:55:32,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-12-15 21:55:32,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706542264] [2023-12-15 21:55:32,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:55:32,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:55:32,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:32,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:55:32,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:55:32,120 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:55:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:32,168 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2023-12-15 21:55:32,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:55:32,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-12-15 21:55:32,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:32,169 INFO L225 Difference]: With dead ends: 63 [2023-12-15 21:55:32,169 INFO L226 Difference]: Without dead ends: 47 [2023-12-15 21:55:32,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:55:32,171 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:32,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 38 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:55:32,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-15 21:55:32,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-15 21:55:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:55:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2023-12-15 21:55:32,181 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 30 [2023-12-15 21:55:32,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:32,181 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2023-12-15 21:55:32,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:55:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2023-12-15 21:55:32,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-15 21:55:32,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:32,182 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:32,189 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:55:32,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:32,387 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:32,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:32,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1831728157, now seen corresponding path program 1 times [2023-12-15 21:55:32,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:32,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537487440] [2023-12-15 21:55:32,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:32,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:32,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:32,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:55:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:55:32,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:32,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537487440] [2023-12-15 21:55:32,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537487440] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:32,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992977592] [2023-12-15 21:55:32,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:32,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:32,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:32,846 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:55:32,872 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:55:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:32,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-15 21:55:32,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:33,061 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 13 treesize of output 9 [2023-12-15 21:55:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-15 21:55:33,187 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:55:33,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2023-12-15 21:55:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-15 21:55:33,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992977592] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:55:33,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:55:33,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 10] total 32 [2023-12-15 21:55:33,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435839483] [2023-12-15 21:55:33,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:55:33,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-15 21:55:33,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:33,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-15 21:55:33,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2023-12-15 21:55:33,352 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 30 states have internal predecessors, (77), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-15 21:55:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:33,891 INFO L93 Difference]: Finished difference Result 129 states and 151 transitions. [2023-12-15 21:55:33,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-15 21:55:33,891 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 30 states have internal predecessors, (77), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 33 [2023-12-15 21:55:33,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:33,892 INFO L225 Difference]: With dead ends: 129 [2023-12-15 21:55:33,893 INFO L226 Difference]: Without dead ends: 127 [2023-12-15 21:55:33,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=1816, Unknown=0, NotChecked=0, Total=2070 [2023-12-15 21:55:33,894 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 234 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:33,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 396 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:55:33,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-12-15 21:55:33,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 77. [2023-12-15 21:55:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 72 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:55:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2023-12-15 21:55:33,911 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 33 [2023-12-15 21:55:33,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:33,911 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2023-12-15 21:55:33,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 30 states have internal predecessors, (77), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-15 21:55:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2023-12-15 21:55:33,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-15 21:55:33,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:33,912 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:33,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-15 21:55:34,116 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,SelfDestructingSolverStorable9 [2023-12-15 21:55:34,117 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:34,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:34,117 INFO L85 PathProgramCache]: Analyzing trace with hash 2012227268, now seen corresponding path program 4 times [2023-12-15 21:55:34,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:34,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128029256] [2023-12-15 21:55:34,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:34,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:34,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:34,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:55:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-15 21:55:34,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:34,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128029256] [2023-12-15 21:55:34,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128029256] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:34,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95880377] [2023-12-15 21:55:34,217 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-15 21:55:34,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:34,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:34,218 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:55:34,242 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:55:34,354 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-15 21:55:34,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:55:34,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 21:55:34,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-15 21:55:34,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:55:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-15 21:55:34,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95880377] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:55:34,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:55:34,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2023-12-15 21:55:34,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477390847] [2023-12-15 21:55:34,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:55:34,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-15 21:55:34,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:34,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-15 21:55:34,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:55:34,427 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 21:55:34,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:34,554 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2023-12-15 21:55:34,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:55:34,554 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-12-15 21:55:34,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:34,556 INFO L225 Difference]: With dead ends: 102 [2023-12-15 21:55:34,556 INFO L226 Difference]: Without dead ends: 57 [2023-12-15 21:55:34,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2023-12-15 21:55:34,557 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 51 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:34,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 98 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:55:34,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-15 21:55:34,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2023-12-15 21:55:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:55:34,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-12-15 21:55:34,565 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 33 [2023-12-15 21:55:34,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:34,566 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-12-15 21:55:34,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 21:55:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-12-15 21:55:34,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-15 21:55:34,566 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:34,566 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:34,573 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:55:34,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:34,771 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:34,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:34,771 INFO L85 PathProgramCache]: Analyzing trace with hash -948978662, now seen corresponding path program 2 times [2023-12-15 21:55:34,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:34,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151107068] [2023-12-15 21:55:34,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:34,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:34,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:34,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:55:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-15 21:55:34,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:34,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151107068] [2023-12-15 21:55:34,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151107068] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:34,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226485358] [2023-12-15 21:55:34,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 21:55:34,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:34,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:34,893 INFO L229 MonitoredProcess]: Starting monitored process 11 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:55:34,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-15 21:55:35,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 21:55:35,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:55:35,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 21:55:35,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 21:55:35,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:55:35,095 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 21:55:35,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226485358] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:55:35,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:55:35,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2023-12-15 21:55:35,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380740762] [2023-12-15 21:55:35,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:55:35,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:55:35,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:35,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:55:35,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:55:35,096 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 21:55:35,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:35,169 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2023-12-15 21:55:35,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:55:35,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2023-12-15 21:55:35,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:35,170 INFO L225 Difference]: With dead ends: 52 [2023-12-15 21:55:35,170 INFO L226 Difference]: Without dead ends: 30 [2023-12-15 21:55:35,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:55:35,171 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:35,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 54 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:55:35,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-15 21:55:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-15 21:55:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:55:35,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2023-12-15 21:55:35,174 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 34 [2023-12-15 21:55:35,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:35,174 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2023-12-15 21:55:35,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 21:55:35,174 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2023-12-15 21:55:35,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-15 21:55:35,175 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:35,175 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:35,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-15 21:55:35,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-15 21:55:35,381 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:35,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:35,381 INFO L85 PathProgramCache]: Analyzing trace with hash 984214517, now seen corresponding path program 5 times [2023-12-15 21:55:35,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:35,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009978569] [2023-12-15 21:55:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:35,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:35,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:35,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:55:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:35,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:55:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-15 21:55:35,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:35,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009978569] [2023-12-15 21:55:35,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009978569] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:35,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173708222] [2023-12-15 21:55:35,459 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-15 21:55:35,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:35,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:35,460 INFO L229 MonitoredProcess]: Starting monitored process 12 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:55:35,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-15 21:55:35,639 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-12-15 21:55:35,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:55:35,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 21:55:35,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-15 21:55:35,676 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:55:35,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173708222] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:55:35,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:55:35,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-12-15 21:55:35,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003011119] [2023-12-15 21:55:35,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:55:35,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:55:35,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:35,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:55:35,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:55:35,677 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 21:55:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:35,690 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2023-12-15 21:55:35,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:55:35,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2023-12-15 21:55:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:35,690 INFO L225 Difference]: With dead ends: 33 [2023-12-15 21:55:35,690 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 21:55:35,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:55:35,691 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:35,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:55:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 21:55:35,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 21:55:35,691 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:55:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 21:55:35,691 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2023-12-15 21:55:35,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:35,692 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 21:55:35,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 21:55:35,692 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 21:55:35,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 21:55:35,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:55:35,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-15 21:55:35,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-15 21:55:35,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 21:55:36,264 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 620 639) no Hoare annotation was computed. [2023-12-15 21:55:36,264 INFO L895 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse4 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|) 0))) (let ((.cse2 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse0 (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0)) (.cse1 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse4))) (.cse7 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse8 (= 3 |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 (= 2 |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse1 .cse2 .cse3 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (= (select (select |#memory_int#1| .cse4) 4) 3) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_update_at_~index#1|) .cse5 .cse6) (and .cse0 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse4) .cse2 .cse7 .cse8 (= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) .cse5 (not .cse1) .cse6) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5 (= |ULTIMATE.start_sll_circular_update_at_~index#1| 1) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 0) 0) .cse6)))) [2023-12-15 21:55:36,264 INFO L899 garLoopResultBuilder]: For program point L614-3(lines 614 617) no Hoare annotation was computed. [2023-12-15 21:55:36,264 INFO L899 garLoopResultBuilder]: For program point L631(lines 631 633) no Hoare annotation was computed. [2023-12-15 21:55:36,264 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2023-12-15 21:55:36,265 INFO L899 garLoopResultBuilder]: For program point L598-3(lines 598 602) no Hoare annotation was computed. [2023-12-15 21:55:36,265 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse10 (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)) (.cse8 (select |#memory_int#1| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (.cse1 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse2 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (= (select .cse10 4) 2)) (.cse4 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse5 (= (select (select |#memory_int#1| (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|) 0)) 4) 3)) (.cse6 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse9 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 3 (select .cse8 4)) .cse9) (and (= (select .cse10 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) 2) (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse7 (= 2 (select .cse8 (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)))) (let ((.cse11 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 0))) (and (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 0) 0) .cse1 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| .cse11)) .cse5 .cse6 .cse7 (= (select (select |#memory_int#1| .cse11) 4) 3) .cse9))))) [2023-12-15 21:55:36,265 INFO L899 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2023-12-15 21:55:36,265 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 21:55:36,265 INFO L895 garLoopResultBuilder]: At program point L625-3(lines 625 628) the Hoare annotation is: (let ((.cse5 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|) 0))) (let ((.cse0 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse1 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse5))) (.cse4 (= (select (select |#memory_int#1| .cse5) 4) 3)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) .cse2 .cse3) (and .cse0 (= (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 4) 2) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) .cse4 .cse2 .cse3) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse4 .cse2 .cse3)))) [2023-12-15 21:55:36,265 INFO L899 garLoopResultBuilder]: For program point L625-4(lines 625 628) no Hoare annotation was computed. [2023-12-15 21:55:36,265 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2)) [2023-12-15 21:55:36,265 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2023-12-15 21:55:36,265 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 637) no Hoare annotation was computed. [2023-12-15 21:55:36,265 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) .cse0 (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) .cse1 (not .cse2)) (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) .cse0 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) .cse2 .cse1))) [2023-12-15 21:55:36,265 INFO L899 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2023-12-15 21:55:36,265 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 21:55:36,265 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2023-12-15 21:55:36,265 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2)) [2023-12-15 21:55:36,265 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2023-12-15 21:55:36,265 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 620 639) no Hoare annotation was computed. [2023-12-15 21:55:36,266 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2023-12-15 21:55:36,266 INFO L895 garLoopResultBuilder]: At program point L629-3(lines 629 634) the Hoare annotation is: (let ((.cse0 (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and (= (select .cse0 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) 2) (<= |ULTIMATE.start_main_~i~0#1| 0) .cse1) (and (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select .cse0 4) 2) (= (select (select |#memory_int#1| (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|) 0)) 4) 3) .cse1 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) .cse1))) [2023-12-15 21:55:36,266 INFO L899 garLoopResultBuilder]: For program point L629-4(lines 629 634) no Hoare annotation was computed. [2023-12-15 21:55:36,266 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-15 21:55:36,266 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-15 21:55:36,266 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) [2023-12-15 21:55:36,266 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-12-15 21:55:36,268 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1] [2023-12-15 21:55:36,269 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:55:36,277 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][0] could not be translated [2023-12-15 21:55:36,278 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][0] could not be translated [2023-12-15 21:55:36,278 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-15 21:55:36,279 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][~s~0!offset + 4] could not be translated [2023-12-15 21:55:36,279 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-15 21:55:36,279 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated [2023-12-15 21:55:36,279 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated [2023-12-15 21:55:36,280 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:55:36,280 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:55:36,280 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-15 21:55:36,280 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-15 21:55:36,280 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated [2023-12-15 21:55:36,280 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:55:36,281 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:55:36,281 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-15 21:55:36,281 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-15 21:55:36,281 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:55:36,281 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:55:36,281 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:55:36,281 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-15 21:55:36,281 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated [2023-12-15 21:55:36,305 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-15 21:55:36,305 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-15 21:55:36,305 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-15 21:55:36,305 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated [2023-12-15 21:55:36,305 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated [2023-12-15 21:55:36,310 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-15 21:55:36,310 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-15 21:55:36,310 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated [2023-12-15 21:55:36,314 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-15 21:55:36,314 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated [2023-12-15 21:55:36,314 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated [2023-12-15 21:55:36,314 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:55:36,314 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][4] could not be translated [2023-12-15 21:55:36,315 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][~s~0!offset + 4] could not be translated [2023-12-15 21:55:36,315 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][~head!offset + 4] could not be translated [2023-12-15 21:55:36,315 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated [2023-12-15 21:55:36,315 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-15 21:55:36,315 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated [2023-12-15 21:55:36,315 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:55:36,315 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated [2023-12-15 21:55:36,315 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated [2023-12-15 21:55:36,315 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:55:36,336 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][0]][4] could not be translated [2023-12-15 21:55:36,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:55:36 BoogieIcfgContainer [2023-12-15 21:55:36,336 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:55:36,337 INFO L158 Benchmark]: Toolchain (without parser) took 14202.61ms. Allocated memory was 218.1MB in the beginning and 457.2MB in the end (delta: 239.1MB). Free memory was 160.1MB in the beginning and 423.8MB in the end (delta: -263.7MB). Peak memory consumption was 44.6MB. Max. memory is 8.0GB. [2023-12-15 21:55:36,337 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 218.1MB. Free memory is still 172.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:55:36,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.65ms. Allocated memory is still 218.1MB. Free memory was 159.8MB in the beginning and 141.7MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-15 21:55:36,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.66ms. Allocated memory is still 218.1MB. Free memory was 141.7MB in the beginning and 139.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:55:36,337 INFO L158 Benchmark]: Boogie Preprocessor took 68.05ms. Allocated memory was 218.1MB in the beginning and 359.7MB in the end (delta: 141.6MB). Free memory was 139.6MB in the beginning and 331.5MB in the end (delta: -191.9MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. [2023-12-15 21:55:36,337 INFO L158 Benchmark]: RCFGBuilder took 343.87ms. Allocated memory is still 359.7MB. Free memory was 331.5MB in the beginning and 311.6MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-15 21:55:36,337 INFO L158 Benchmark]: TraceAbstraction took 13394.79ms. Allocated memory was 359.7MB in the beginning and 457.2MB in the end (delta: 97.5MB). Free memory was 311.1MB in the beginning and 423.8MB in the end (delta: -112.7MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. [2023-12-15 21:55:36,338 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 218.1MB. Free memory is still 172.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 355.65ms. Allocated memory is still 218.1MB. Free memory was 159.8MB in the beginning and 141.7MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.66ms. Allocated memory is still 218.1MB. Free memory was 141.7MB in the beginning and 139.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.05ms. Allocated memory was 218.1MB in the beginning and 359.7MB in the end (delta: 141.6MB). Free memory was 139.6MB in the beginning and 331.5MB in the end (delta: -191.9MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. * RCFGBuilder took 343.87ms. Allocated memory is still 359.7MB. Free memory was 331.5MB in the beginning and 311.6MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 13394.79ms. Allocated memory was 359.7MB in the beginning and 457.2MB in the end (delta: 97.5MB). Free memory was 311.1MB in the beginning and 423.8MB in the end (delta: -112.7MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][~s~0!offset + 4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][~s~0!offset + 4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][~head!offset + 4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][0]][4] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 637]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 657 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 653 mSDsluCounter, 1283 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 128 IncrementalHoareTripleChecker+Unchecked, 1085 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1911 IncrementalHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 198 mSDtfsCounter, 1911 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 646 GetRequests, 439 SyntacticMatches, 9 SemanticMatches, 198 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1371 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=10, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 105 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 28 NumberOfFragments, 528 HoareAnnotationTreeSize, 11 FormulaSimplifications, 4380 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FormulaSimplificationsInter, 194 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 674 NumberOfCodeBlocks, 659 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 799 ConstructedInterpolants, 12 QuantifiedInterpolants, 4477 SizeOfPredicates, 64 NumberOfNonLiveVariables, 3116 ConjunctsInSsa, 202 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 277/379 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: (((len <= 1) && (len == 2)) || ((2 == len) && (len == 2))) - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: ((((i <= 0) && (len == 2)) || ((i == 1) && (len == 2))) || (((i + 1) <= 0) && (len == 2))) - InvariantResult [Line: 614]: Loop Invariant Derived loop invariant: ((((2 == data) && (index <= 0)) || ((3 == data) && (index == 0))) || ((3 == data) && (index == 1))) - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: ((((i == 1) && (len == 2)) || (((i + 1) <= 0) && (len == 2))) || ((i == 0) && (len == 2))) - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: (((index <= 0) || (index <= 0)) || (index == 1)) RESULT: Ultimate proved your program to be correct! [2023-12-15 21:55:36,369 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...