/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/sll2c_remove_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 03:47:57,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 03:47:57,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 03:47:57,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 03:47:57,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 03:47:57,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 03:47:57,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 03:47:57,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 03:47:57,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 03:47:57,273 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 03:47:57,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 03:47:57,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 03:47:57,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 03:47:57,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 03:47:57,275 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 03:47:57,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 03:47:57,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 03:47:57,275 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 03:47:57,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 03:47:57,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 03:47:57,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 03:47:57,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 03:47:57,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 03:47:57,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 03:47:57,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 03:47:57,277 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 03:47:57,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 03:47:57,277 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 03:47:57,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 03:47:57,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 03:47:57,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 03:47:57,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 03:47:57,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:47:57,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 03:47:57,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 03:47:57,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 03:47:57,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 03:47:57,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 03:47:57,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 03:47:57,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 03:47:57,279 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 03:47:57,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 03:47:57,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 03:47:57,280 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 03:47:57,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 03:47:57,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 03:47:57,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 03:47:57,487 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 03:47:57,488 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 03:47:57,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_remove_all_reverse.i [2023-12-21 03:47:58,543 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 03:47:58,766 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 03:47:58,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_remove_all_reverse.i [2023-12-21 03:47:58,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/123ccd40f/7aea000a068d469cb37cbf08fde37151/FLAGdce366675 [2023-12-21 03:47:58,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/123ccd40f/7aea000a068d469cb37cbf08fde37151 [2023-12-21 03:47:58,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 03:47:58,798 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 03:47:58,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 03:47:58,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 03:47:58,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 03:47:58,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:47:58" (1/1) ... [2023-12-21 03:47:58,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b0abd1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:58, skipping insertion in model container [2023-12-21 03:47:58,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:47:58" (1/1) ... [2023-12-21 03:47:58,842 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 03:47:59,042 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_remove_all_reverse.i[24151,24164] [2023-12-21 03:47:59,045 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:47:59,050 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 03:47:59,093 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_remove_all_reverse.i[24151,24164] [2023-12-21 03:47:59,093 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:47:59,122 INFO L206 MainTranslator]: Completed translation [2023-12-21 03:47:59,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:59 WrapperNode [2023-12-21 03:47:59,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 03:47:59,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 03:47:59,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 03:47:59,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 03:47:59,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:59" (1/1) ... [2023-12-21 03:47:59,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:59" (1/1) ... [2023-12-21 03:47:59,165 INFO L138 Inliner]: procedures = 126, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2023-12-21 03:47:59,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 03:47:59,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 03:47:59,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 03:47:59,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 03:47:59,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:59" (1/1) ... [2023-12-21 03:47:59,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:59" (1/1) ... [2023-12-21 03:47:59,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:59" (1/1) ... [2023-12-21 03:47:59,188 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2023-12-21 03:47:59,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:59" (1/1) ... [2023-12-21 03:47:59,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:59" (1/1) ... [2023-12-21 03:47:59,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:59" (1/1) ... [2023-12-21 03:47:59,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:59" (1/1) ... [2023-12-21 03:47:59,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:59" (1/1) ... [2023-12-21 03:47:59,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:59" (1/1) ... [2023-12-21 03:47:59,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 03:47:59,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 03:47:59,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 03:47:59,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 03:47:59,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:59" (1/1) ... [2023-12-21 03:47:59,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:47:59,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:47:59,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 03:47:59,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 03:47:59,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 03:47:59,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 03:47:59,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 03:47:59,283 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-21 03:47:59,283 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-21 03:47:59,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 03:47:59,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 03:47:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 03:47:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 03:47:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 03:47:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-21 03:47:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 03:47:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 03:47:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-21 03:47:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 03:47:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-21 03:47:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-21 03:47:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-21 03:47:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 03:47:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 03:47:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 03:47:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 03:47:59,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 03:47:59,458 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 03:47:59,459 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 03:47:59,649 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 03:47:59,680 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 03:47:59,681 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-21 03:47:59,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:47:59 BoogieIcfgContainer [2023-12-21 03:47:59,683 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 03:47:59,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 03:47:59,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 03:47:59,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 03:47:59,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:47:58" (1/3) ... [2023-12-21 03:47:59,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d157b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:47:59, skipping insertion in model container [2023-12-21 03:47:59,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:59" (2/3) ... [2023-12-21 03:47:59,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d157b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:47:59, skipping insertion in model container [2023-12-21 03:47:59,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:47:59" (3/3) ... [2023-12-21 03:47:59,689 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_reverse.i [2023-12-21 03:47:59,702 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 03:47:59,702 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 03:47:59,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 03:47:59,736 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;@67022c61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 03:47:59,736 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 03:47:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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-21 03:47:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 03:47:59,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:47:59,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:47:59,746 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:47:59,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:47:59,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1696884172, now seen corresponding path program 1 times [2023-12-21 03:47:59,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:47:59,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753806002] [2023-12-21 03:47:59,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:59,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:47:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:59,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:47:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:47:59,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:47:59,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753806002] [2023-12-21 03:47:59,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753806002] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:47:59,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:47:59,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 03:47:59,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281449796] [2023-12-21 03:47:59,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:47:59,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 03:47:59,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:00,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 03:48:00,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:48:00,015 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 03:48:00,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:48:00,130 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2023-12-21 03:48:00,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 03:48:00,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-21 03:48:00,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:48:00,137 INFO L225 Difference]: With dead ends: 42 [2023-12-21 03:48:00,137 INFO L226 Difference]: Without dead ends: 23 [2023-12-21 03:48:00,139 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-21 03:48:00,143 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:48:00,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:48:00,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-21 03:48:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-21 03:48:00,165 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-21 03:48:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-12-21 03:48:00,168 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 12 [2023-12-21 03:48:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:48:00,169 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-12-21 03:48:00,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 03:48:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-12-21 03:48:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 03:48:00,171 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:48:00,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:48:00,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 03:48:00,172 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:48:00,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:48:00,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1523887835, now seen corresponding path program 1 times [2023-12-21 03:48:00,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:48:00,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566027074] [2023-12-21 03:48:00,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:00,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:48:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:00,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:48:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:48:00,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:48:00,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566027074] [2023-12-21 03:48:00,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566027074] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:48:00,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:48:00,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 03:48:00,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960082351] [2023-12-21 03:48:00,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:48:00,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:48:00,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:00,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:48:00,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:48:00,361 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 03:48:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:48:00,406 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2023-12-21 03:48:00,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:48:00,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-21 03:48:00,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:48:00,408 INFO L225 Difference]: With dead ends: 40 [2023-12-21 03:48:00,408 INFO L226 Difference]: Without dead ends: 26 [2023-12-21 03:48:00,409 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-21 03:48:00,410 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:48:00,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 52 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:48:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-21 03:48:00,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-12-21 03:48:00,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:48:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-12-21 03:48:00,421 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 12 [2023-12-21 03:48:00,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:48:00,421 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-12-21 03:48:00,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 03:48:00,422 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-12-21 03:48:00,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-21 03:48:00,422 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:48:00,422 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:48:00,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 03:48:00,423 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:48:00,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:48:00,424 INFO L85 PathProgramCache]: Analyzing trace with hash 815803536, now seen corresponding path program 1 times [2023-12-21 03:48:00,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:48:00,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725506214] [2023-12-21 03:48:00,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:00,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:48:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:00,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:48:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:00,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:48:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:00,538 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-21 03:48:00,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:48:00,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725506214] [2023-12-21 03:48:00,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725506214] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:48:00,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:48:00,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 03:48:00,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926781026] [2023-12-21 03:48:00,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:48:00,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 03:48:00,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:00,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 03:48:00,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:48:00,540 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-21 03:48:00,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:48:00,581 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2023-12-21 03:48:00,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:48:00,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2023-12-21 03:48:00,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:48:00,582 INFO L225 Difference]: With dead ends: 37 [2023-12-21 03:48:00,582 INFO L226 Difference]: Without dead ends: 33 [2023-12-21 03:48:00,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:48:00,583 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:48:00,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 52 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:48:00,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-21 03:48:00,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2023-12-21 03:48:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:48:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-12-21 03:48:00,588 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 18 [2023-12-21 03:48:00,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:48:00,588 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-12-21 03:48:00,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-21 03:48:00,589 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-12-21 03:48:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-21 03:48:00,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:48:00,589 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-21 03:48:00,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 03:48:00,590 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:48:00,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:48:00,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1293093265, now seen corresponding path program 1 times [2023-12-21 03:48:00,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:48:00,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916900969] [2023-12-21 03:48:00,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:00,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:48:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:00,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:48:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:00,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:48:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:00,753 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-21 03:48:00,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:48:00,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916900969] [2023-12-21 03:48:00,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916900969] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:48:00,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370824392] [2023-12-21 03:48:00,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:00,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:48:00,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:48:00,761 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:48:00,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 03:48:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:00,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 03:48:00,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:48:00,950 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-21 03:48:00,951 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:48:01,033 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-21 03:48:01,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370824392] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:48:01,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:48:01,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-12-21 03:48:01,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875569926] [2023-12-21 03:48:01,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:48:01,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 03:48:01,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:01,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 03:48:01,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-21 03:48:01,035 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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-21 03:48:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:48:01,082 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2023-12-21 03:48:01,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 03:48:01,083 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2023-12-21 03:48:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:48:01,084 INFO L225 Difference]: With dead ends: 38 [2023-12-21 03:48:01,084 INFO L226 Difference]: Without dead ends: 34 [2023-12-21 03:48:01,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-21 03:48:01,084 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 45 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:48:01,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 85 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:48:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-21 03:48:01,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-21 03:48:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 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-21 03:48:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2023-12-21 03:48:01,088 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 24 [2023-12-21 03:48:01,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:48:01,089 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2023-12-21 03:48:01,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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-21 03:48:01,089 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2023-12-21 03:48:01,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-21 03:48:01,089 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:48:01,089 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] [2023-12-21 03:48:01,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 03:48:01,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:48:01,296 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:48:01,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:48:01,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1038982702, now seen corresponding path program 2 times [2023-12-21 03:48:01,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:48:01,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557466691] [2023-12-21 03:48:01,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:01,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:48:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:01,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:48:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:01,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:48:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:48:01,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:48:01,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557466691] [2023-12-21 03:48:01,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557466691] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:48:01,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:48:01,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 03:48:01,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145373499] [2023-12-21 03:48:01,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:48:01,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 03:48:01,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:01,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 03:48:01,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:48:01,459 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-21 03:48:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:48:01,543 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2023-12-21 03:48:01,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 03:48:01,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-21 03:48:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:48:01,545 INFO L225 Difference]: With dead ends: 49 [2023-12-21 03:48:01,545 INFO L226 Difference]: Without dead ends: 34 [2023-12-21 03:48:01,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 03:48:01,548 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:48:01,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 83 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:48:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-21 03:48:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-21 03:48:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 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-21 03:48:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2023-12-21 03:48:01,560 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 30 [2023-12-21 03:48:01,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:48:01,561 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-12-21 03:48:01,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-21 03:48:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2023-12-21 03:48:01,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 03:48:01,561 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:48:01,562 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:48:01,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 03:48:01,562 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:48:01,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:48:01,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1906109968, now seen corresponding path program 1 times [2023-12-21 03:48:01,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:48:01,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481293546] [2023-12-21 03:48:01,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:01,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:48:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:01,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:48:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:01,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:48:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-21 03:48:01,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:48:01,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481293546] [2023-12-21 03:48:01,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481293546] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:48:01,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:48:01,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 03:48:01,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806037031] [2023-12-21 03:48:01,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:48:01,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 03:48:01,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:01,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 03:48:01,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:48:01,687 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:48:01,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:48:01,732 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2023-12-21 03:48:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:48:01,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-12-21 03:48:01,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:48:01,733 INFO L225 Difference]: With dead ends: 60 [2023-12-21 03:48:01,733 INFO L226 Difference]: Without dead ends: 38 [2023-12-21 03:48:01,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:48:01,734 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:48:01,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:48:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-21 03:48:01,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-21 03:48:01,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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-21 03:48:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2023-12-21 03:48:01,738 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 36 [2023-12-21 03:48:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:48:01,738 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-12-21 03:48:01,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:48:01,739 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2023-12-21 03:48:01,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-21 03:48:01,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:48:01,739 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:48:01,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 03:48:01,739 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:48:01,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:48:01,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1465101296, now seen corresponding path program 1 times [2023-12-21 03:48:01,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:48:01,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064041004] [2023-12-21 03:48:01,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:01,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:48:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:02,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:48:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:02,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:48:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 03:48:02,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:48:02,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064041004] [2023-12-21 03:48:02,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064041004] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:48:02,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729424162] [2023-12-21 03:48:02,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:02,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:48:02,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:48:02,105 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:48:02,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 03:48:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:02,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-21 03:48:02,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:48:02,438 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 27 treesize of output 19 [2023-12-21 03:48:02,445 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 27 treesize of output 19 [2023-12-21 03:48:02,732 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 125 treesize of output 81 [2023-12-21 03:48:02,737 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 85 treesize of output 65 [2023-12-21 03:48:02,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:48:02,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 66 [2023-12-21 03:48:02,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:48:02,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 54 [2023-12-21 03:48:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 03:48:02,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:48:03,130 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 64 treesize of output 52 [2023-12-21 03:48:03,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:48:03,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:48:03,187 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-21 03:48:03,187 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 11 treesize of output 11 [2023-12-21 03:48:03,210 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 03:48:03,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729424162] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:48:03,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:48:03,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 10] total 22 [2023-12-21 03:48:03,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800820660] [2023-12-21 03:48:03,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:48:03,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-21 03:48:03,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:03,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-21 03:48:03,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2023-12-21 03:48:03,211 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 21 states have internal predecessors, (71), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 03:48:03,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:48:03,468 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2023-12-21 03:48:03,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 03:48:03,468 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 21 states have internal predecessors, (71), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2023-12-21 03:48:03,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:48:03,469 INFO L225 Difference]: With dead ends: 69 [2023-12-21 03:48:03,469 INFO L226 Difference]: Without dead ends: 49 [2023-12-21 03:48:03,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2023-12-21 03:48:03,470 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:48:03,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 156 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:48:03,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-21 03:48:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2023-12-21 03:48:03,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 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-21 03:48:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2023-12-21 03:48:03,493 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 40 [2023-12-21 03:48:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:48:03,493 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2023-12-21 03:48:03,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 21 states have internal predecessors, (71), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 03:48:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2023-12-21 03:48:03,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-21 03:48:03,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:48:03,494 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:48:03,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 03:48:03,700 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,SelfDestructingSolverStorable6 [2023-12-21 03:48:03,700 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:48:03,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:48:03,702 INFO L85 PathProgramCache]: Analyzing trace with hash 721078123, now seen corresponding path program 1 times [2023-12-21 03:48:03,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:48:03,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270436123] [2023-12-21 03:48:03,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:03,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:48:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:03,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:48:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:03,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:48:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-21 03:48:03,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:48:03,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270436123] [2023-12-21 03:48:03,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270436123] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:48:03,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727819186] [2023-12-21 03:48:03,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:03,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:48:03,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:48:03,880 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:48:03,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 03:48:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:04,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 03:48:04,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:48:04,040 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 26 [2023-12-21 03:48:04,042 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 30 treesize of output 18 [2023-12-21 03:48:04,049 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 15 treesize of output 7 [2023-12-21 03:48:04,051 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 15 treesize of output 7 [2023-12-21 03:48:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-21 03:48:04,054 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:48:04,086 INFO L349 Elim1Store]: treesize reduction 4, result has 78.9 percent of original size [2023-12-21 03:48:04,086 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 19 treesize of output 19 [2023-12-21 03:48:04,098 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-21 03:48:04,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727819186] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:48:04,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:48:04,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-12-21 03:48:04,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297121568] [2023-12-21 03:48:04,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:48:04,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 03:48:04,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:04,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 03:48:04,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:48:04,100 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:48:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:48:04,189 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2023-12-21 03:48:04,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 03:48:04,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2023-12-21 03:48:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:48:04,190 INFO L225 Difference]: With dead ends: 83 [2023-12-21 03:48:04,190 INFO L226 Difference]: Without dead ends: 54 [2023-12-21 03:48:04,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-21 03:48:04,191 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:48:04,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:48:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-21 03:48:04,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2023-12-21 03:48:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 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-21 03:48:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2023-12-21 03:48:04,197 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 42 [2023-12-21 03:48:04,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:48:04,197 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2023-12-21 03:48:04,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:48:04,197 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2023-12-21 03:48:04,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-21 03:48:04,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:48:04,197 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:48:04,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 03:48:04,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:48:04,403 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:48:04,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:48:04,404 INFO L85 PathProgramCache]: Analyzing trace with hash 336492294, now seen corresponding path program 2 times [2023-12-21 03:48:04,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:48:04,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134707427] [2023-12-21 03:48:04,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:04,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:48:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:05,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:48:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:05,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:48:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 03:48:05,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:48:05,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134707427] [2023-12-21 03:48:05,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134707427] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:48:05,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633025213] [2023-12-21 03:48:05,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:48:05,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:48:05,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:48:05,148 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-21 03:48:05,183 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-21 03:48:05,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:48:05,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:48:05,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 121 conjunts are in the unsatisfiable core [2023-12-21 03:48:05,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:48:05,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:48:05,421 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 18 treesize of output 7 [2023-12-21 03:48:05,616 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-21 03:48:05,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2023-12-21 03:48:05,634 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-21 03:48:05,634 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-21 03:48:05,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-21 03:48:05,687 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-21 03:48:05,762 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-21 03:48:05,762 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 90 treesize of output 52 [2023-12-21 03:48:05,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2023-12-21 03:48:06,472 INFO L349 Elim1Store]: treesize reduction 30, result has 63.0 percent of original size [2023-12-21 03:48:06,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 89 [2023-12-21 03:48:06,492 INFO L349 Elim1Store]: treesize reduction 13, result has 55.2 percent of original size [2023-12-21 03:48:06,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 26 [2023-12-21 03:48:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:48:06,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:48:06,947 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 229 treesize of output 197 [2023-12-21 03:48:06,950 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 201 treesize of output 173 [2023-12-21 03:48:07,211 INFO L349 Elim1Store]: treesize reduction 441, result has 46.3 percent of original size [2023-12-21 03:48:07,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 9270 treesize of output 7889 [2023-12-21 03:48:16,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633025213] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:48:16,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:48:16,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 34 [2023-12-21 03:48:16,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020257773] [2023-12-21 03:48:16,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:48:16,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 03:48:16,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:16,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 03:48:16,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1817, Unknown=0, NotChecked=0, Total=1980 [2023-12-21 03:48:16,894 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 34 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 03:48:17,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:48:17,792 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2023-12-21 03:48:17,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 03:48:17,793 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2023-12-21 03:48:17,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:48:17,795 INFO L225 Difference]: With dead ends: 111 [2023-12-21 03:48:17,795 INFO L226 Difference]: Without dead ends: 76 [2023-12-21 03:48:17,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=320, Invalid=2760, Unknown=0, NotChecked=0, Total=3080 [2023-12-21 03:48:17,796 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 03:48:17,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 203 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 03:48:17,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-12-21 03:48:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2023-12-21 03:48:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 69 states have internal predecessors, (80), 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-21 03:48:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2023-12-21 03:48:17,804 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 44 [2023-12-21 03:48:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:48:17,804 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2023-12-21 03:48:17,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 03:48:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2023-12-21 03:48:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-21 03:48:17,805 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:48:17,805 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:48:17,824 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-21 03:48:18,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:48:18,013 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:48:18,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:48:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1985711900, now seen corresponding path program 3 times [2023-12-21 03:48:18,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:48:18,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065386891] [2023-12-21 03:48:18,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:18,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:48:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:18,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:48:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:18,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:48:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 03:48:18,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:48:18,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065386891] [2023-12-21 03:48:18,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065386891] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:48:18,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275559305] [2023-12-21 03:48:18,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 03:48:18,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:48:18,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:48:18,746 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-21 03:48:18,789 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-21 03:48:19,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-21 03:48:19,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:48:19,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 104 conjunts are in the unsatisfiable core [2023-12-21 03:48:19,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:48:19,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:48:19,362 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-21 03:48:19,362 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-21 03:48:19,405 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-21 03:48:19,409 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-21 03:48:19,463 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-21 03:48:19,463 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 75 treesize of output 45 [2023-12-21 03:48:19,466 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 39 treesize of output 30 [2023-12-21 03:48:19,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:48:19,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:48:19,681 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 03:48:19,681 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 03:48:19,681 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 03:48:19,686 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-21 03:48:19,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 16 [2023-12-21 03:48:19,788 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2023-12-21 03:48:19,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 1 [2023-12-21 03:48:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-21 03:48:19,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:48:19,904 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 128 treesize of output 104 [2023-12-21 03:48:19,907 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 108 treesize of output 84 [2023-12-21 03:48:19,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:48:19,969 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 840 treesize of output 720 [2023-12-21 03:48:20,049 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 03:48:20,050 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 840 treesize of output 1 [2023-12-21 03:48:20,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275559305] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:48:20,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:48:20,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2023-12-21 03:48:20,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436831363] [2023-12-21 03:48:20,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:48:20,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-21 03:48:20,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:20,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-21 03:48:20,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2023-12-21 03:48:20,231 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 29 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 03:48:20,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:48:20,481 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2023-12-21 03:48:20,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 03:48:20,482 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2023-12-21 03:48:20,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:48:20,483 INFO L225 Difference]: With dead ends: 104 [2023-12-21 03:48:20,483 INFO L226 Difference]: Without dead ends: 57 [2023-12-21 03:48:20,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=140, Invalid=1266, Unknown=0, NotChecked=0, Total=1406 [2023-12-21 03:48:20,484 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 03:48:20,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 252 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 03:48:20,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-21 03:48:20,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2023-12-21 03:48:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 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-21 03:48:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2023-12-21 03:48:20,496 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 48 [2023-12-21 03:48:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:48:20,497 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2023-12-21 03:48:20,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 03:48:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2023-12-21 03:48:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 03:48:20,497 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:48:20,497 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:48:20,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-21 03:48:20,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-21 03:48:20,711 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:48:20,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:48:20,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1311629499, now seen corresponding path program 4 times [2023-12-21 03:48:20,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:48:20,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105226839] [2023-12-21 03:48:20,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:20,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:48:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:20,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:48:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:20,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:48:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:20,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 03:48:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-21 03:48:20,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:48:20,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105226839] [2023-12-21 03:48:20,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105226839] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:48:20,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035434436] [2023-12-21 03:48:20,786 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 03:48:20,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:48:20,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:48:20,787 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-21 03:48:20,789 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-21 03:48:20,996 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 03:48:20,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:48:20,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 03:48:21,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:48:21,018 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-21 03:48:21,018 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 03:48:21,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035434436] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:48:21,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 03:48:21,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-12-21 03:48:21,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887821728] [2023-12-21 03:48:21,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:48:21,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:48:21,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:21,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:48:21,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:48:21,020 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-21 03:48:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:48:21,031 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2023-12-21 03:48:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:48:21,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 50 [2023-12-21 03:48:21,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:48:21,032 INFO L225 Difference]: With dead ends: 59 [2023-12-21 03:48:21,032 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 03:48:21,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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-21 03:48:21,035 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:48:21,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:48:21,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 03:48:21,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 03:48:21,036 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-21 03:48:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 03:48:21,037 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2023-12-21 03:48:21,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:48:21,037 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 03:48:21,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-21 03:48:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 03:48:21,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 03:48:21,039 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 03:48:21,058 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-21 03:48:21,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:48:21,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 03:48:21,578 INFO L899 garLoopResultBuilder]: For program point L605-1(lines 605 607) no Hoare annotation was computed. [2023-12-21 03:48:21,578 INFO L895 garLoopResultBuilder]: At program point L605-3(lines 605 607) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_sll_circular_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and .cse0 .cse1 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_sll_circular_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1)) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 (= |ULTIMATE.start_sll_circular_remove_last_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 0)) (= |ULTIMATE.start_sll_circular_remove_last_~last~1#1.base| (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.base|) |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.offset|)) (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.base|) |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.offset|) |ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) .cse1 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.offset|)))) [2023-12-21 03:48:21,578 INFO L899 garLoopResultBuilder]: For program point L605-4(lines 605 607) no Hoare annotation was computed. [2023-12-21 03:48:21,578 INFO L899 garLoopResultBuilder]: For program point L597-1(lines 597 599) no Hoare annotation was computed. [2023-12-21 03:48:21,579 INFO L895 garLoopResultBuilder]: At program point L597-3(lines 597 599) the Hoare annotation is: (let ((.cse15 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse17 (select .cse15 0))) (let ((.cse14 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse18 (select |#memory_$Pointer$#2.base| .cse17))) (let ((.cse2 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 0)) (.cse3 (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 0)) (.cse20 (select .cse18 0)) (.cse19 (select .cse14 0))) (let ((.cse0 (= .cse19 0)) (.cse1 (= |ULTIMATE.start_main_~i~0#1| 0)) (.cse5 (= (select (select |#memory_$Pointer$#2.offset| .cse17) 0) 0)) (.cse7 (= (select (select |#memory_$Pointer$#2.offset| .cse20) 0) 0)) (.cse9 (= .cse17 (select (select |#memory_$Pointer$#2.base| .cse20) 0))) (.cse4 (= |ULTIMATE.start_sll_circular_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse12 (= .cse3 |ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset|)) (.cse8 (= |ULTIMATE.start_sll_circular_remove_last_~head#1.offset| 0)) (.cse13 (= |ULTIMATE.start_sll_circular_remove_last_~last~1#1.base| .cse2)) (.cse10 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (select (select |#memory_$Pointer$#2.offset| .cse2) .cse3)) (.cse16 (<= |ULTIMATE.start_main_~i~0#1| 1))) (or (and .cse0 .cse1 (= (select (select |#memory_$Pointer$#2.base| .cse2) .cse3) |ULTIMATE.start_sll_circular_remove_last_~last~1#1.base|) .cse4 .cse5 (= |ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset| .cse6) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse4 .cse5 .cse12 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11) (and .cse4 .cse11 (= (select .cse14 |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select .cse15 |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_sll_circular_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) .cse16) (and .cse4 .cse12 .cse8 (= .cse17 (select .cse18 .cse19)) .cse13 .cse10 .cse11 (= .cse3 .cse6) .cse16))))))) [2023-12-21 03:48:21,579 INFO L899 garLoopResultBuilder]: For program point L597-4(lines 597 599) no Hoare annotation was computed. [2023-12-21 03:48:21,579 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 612 626) no Hoare annotation was computed. [2023-12-21 03:48:21,579 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2023-12-21 03:48:21,579 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)) (.cse1 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse2 (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) (.cse5 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse3 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and .cse0 (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) .cse1 .cse2 (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) .cse3 .cse4 (not .cse5)) (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) .cse0 .cse1 .cse2 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) .cse5 .cse3 .cse4))) [2023-12-21 03:48:21,579 INFO L899 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2023-12-21 03:48:21,579 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 03:48:21,579 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 611) no Hoare annotation was computed. [2023-12-21 03:48:21,579 INFO L899 garLoopResultBuilder]: For program point L620(lines 620 622) no Hoare annotation was computed. [2023-12-21 03:48:21,579 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~len#1| 2) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2)) [2023-12-21 03:48:21,579 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2023-12-21 03:48:21,579 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 03:48:21,580 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 610) no Hoare annotation was computed. [2023-12-21 03:48:21,580 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 612 626) no Hoare annotation was computed. [2023-12-21 03:48:21,580 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_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2)) [2023-12-21 03:48:21,580 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2023-12-21 03:48:21,580 INFO L895 garLoopResultBuilder]: At program point L617-3(lines 617 619) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select .cse2 0))) (let ((.cse8 (select |#memory_$Pointer$#2.base| .cse6)) (.cse4 (select |#memory_$Pointer$#2.offset| .cse6)) (.cse3 (select .cse1 0)) (.cse7 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse0 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and .cse0 (= (select .cse1 |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select .cse2 |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (let ((.cse5 (select .cse8 0))) (and (= .cse3 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select .cse4 0) 0) (= (select (select |#memory_$Pointer$#2.offset| .cse5) 0) 0) (= .cse6 (select (select |#memory_$Pointer$#2.base| .cse5) 0)) .cse7 .cse0)) (and (= .cse6 (select .cse8 .cse3)) (= (select .cse4 .cse3) .cse3) .cse7 .cse0 (<= |ULTIMATE.start_main_~i~0#1| 1)))))) [2023-12-21 03:48:21,580 INFO L899 garLoopResultBuilder]: For program point L617-4(lines 617 619) no Hoare annotation was computed. [2023-12-21 03:48:21,580 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-21 03:48:21,580 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-21 03:48:21,580 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#valid)| |#valid|)) [2023-12-21 03:48:21,580 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-12-21 03:48:21,583 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2023-12-21 03:48:21,584 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 03:48:21,600 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated [2023-12-21 03:48:21,602 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~head!base][0]][#memory_$Pointer$#1.offset[~head!base][0]] could not be translated [2023-12-21 03:48:21,603 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:48:21,603 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][0] could not be translated [2023-12-21 03:48:21,603 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~head!base][0]][#memory_$Pointer$#1.offset[~head!base][0]] could not be translated [2023-12-21 03:48:21,604 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][0] could not be translated [2023-12-21 03:48:21,604 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:48:21,604 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0] could not be translated [2023-12-21 03:48:21,604 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][0] could not be translated [2023-12-21 03:48:21,604 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated [2023-12-21 03:48:21,604 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:48:21,604 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][0] could not be translated [2023-12-21 03:48:21,604 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated [2023-12-21 03:48:21,604 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][0] could not be translated [2023-12-21 03:48:21,605 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:48:21,605 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated [2023-12-21 03:48:21,605 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0] could not be translated [2023-12-21 03:48:21,605 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][0] could not be translated [2023-12-21 03:48:21,605 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:48:21,605 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-12-21 03:48:21,605 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-21 03:48:21,605 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:48:21,605 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:48:21,605 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated [2023-12-21 03:48:21,605 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:48:21,606 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0] could not be translated [2023-12-21 03:48:21,606 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][#memory_$Pointer$#1.offset[~#s~0!base][0]] could not be translated [2023-12-21 03:48:21,606 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated [2023-12-21 03:48:21,606 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated [2023-12-21 03:48:21,606 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~head!base][0]][#memory_$Pointer$#1.offset[~head!base][0]] could not be translated [2023-12-21 03:48:21,608 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][0] could not be translated [2023-12-21 03:48:21,608 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][0] could not be translated [2023-12-21 03:48:21,608 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~last~0!base][0] could not be translated [2023-12-21 03:48:21,608 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][0] could not be translated [2023-12-21 03:48:21,612 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-21 03:48:21,614 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-12-21 03:48:21,614 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-21 03:48:21,614 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated [2023-12-21 03:48:21,615 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][0] could not be translated [2023-12-21 03:48:21,615 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][0] could not be translated [2023-12-21 03:48:21,615 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0] could not be translated [2023-12-21 03:48:21,615 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][0] could not be translated [2023-12-21 03:48:21,618 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0] could not be translated [2023-12-21 03:48:21,619 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][#memory_$Pointer$#1.offset[~#s~0!base][0]] could not be translated [2023-12-21 03:48:21,619 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][#memory_$Pointer$#1.offset[~#s~0!base][0]] could not be translated [2023-12-21 03:48:21,619 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated [2023-12-21 03:48:21,622 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:48:21,622 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-12-21 03:48:21,622 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-21 03:48:21,622 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:48:21,622 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:48:21,623 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:48:21,623 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated [2023-12-21 03:48:21,623 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~snd_to_last~0!base][~snd_to_last~0!offset] could not be translated [2023-12-21 03:48:21,623 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~snd_to_last~0!base][~snd_to_last~0!offset] could not be translated [2023-12-21 03:48:21,623 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated [2023-12-21 03:48:21,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:48:21 BoogieIcfgContainer [2023-12-21 03:48:21,623 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 03:48:21,624 INFO L158 Benchmark]: Toolchain (without parser) took 22825.90ms. Allocated memory was 217.1MB in the beginning and 882.9MB in the end (delta: 665.8MB). Free memory was 166.1MB in the beginning and 616.5MB in the end (delta: -450.4MB). Peak memory consumption was 217.0MB. Max. memory is 8.0GB. [2023-12-21 03:48:21,624 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 03:48:21,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.24ms. Allocated memory is still 217.1MB. Free memory was 166.1MB in the beginning and 148.2MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-21 03:48:21,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.18ms. Allocated memory is still 217.1MB. Free memory was 148.2MB in the beginning and 146.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:48:21,625 INFO L158 Benchmark]: Boogie Preprocessor took 34.18ms. Allocated memory is still 217.1MB. Free memory was 146.2MB in the beginning and 143.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 03:48:21,626 INFO L158 Benchmark]: RCFGBuilder took 472.14ms. Allocated memory is still 217.1MB. Free memory was 143.0MB in the beginning and 125.7MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-21 03:48:21,626 INFO L158 Benchmark]: TraceAbstraction took 21938.64ms. Allocated memory was 217.1MB in the beginning and 882.9MB in the end (delta: 665.8MB). Free memory was 125.2MB in the beginning and 616.5MB in the end (delta: -491.3MB). Peak memory consumption was 176.1MB. Max. memory is 8.0GB. [2023-12-21 03:48:21,628 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 180.4MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 323.24ms. Allocated memory is still 217.1MB. Free memory was 166.1MB in the beginning and 148.2MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.18ms. Allocated memory is still 217.1MB. Free memory was 148.2MB in the beginning and 146.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.18ms. Allocated memory is still 217.1MB. Free memory was 146.2MB in the beginning and 143.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 472.14ms. Allocated memory is still 217.1MB. Free memory was 143.0MB in the beginning and 125.7MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 21938.64ms. Allocated memory was 217.1MB in the beginning and 882.9MB in the end (delta: 665.8MB). Free memory was 125.2MB in the beginning and 616.5MB in the end (delta: -491.3MB). Peak memory consumption was 176.1MB. 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[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~head!base][0]][#memory_$Pointer$#1.offset[~head!base][0]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~head!base][0]][#memory_$Pointer$#1.offset[~head!base][0]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][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: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][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$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!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$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][#memory_$Pointer$#1.offset[~#s~0!base][0]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~head!base][0]][#memory_$Pointer$#1.offset[~head!base][0]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~last~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset] 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$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][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$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][0]][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$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][#memory_$Pointer$#1.offset[~#s~0!base][0]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][#memory_$Pointer$#1.offset[~#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: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~snd_to_last~0!base][~snd_to_last~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~snd_to_last~0!base][~snd_to_last~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 624]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.9s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 186 mSDsluCounter, 1071 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 876 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1553 IncrementalHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 195 mSDtfsCounter, 1553 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 545 GetRequests, 392 SyntacticMatches, 4 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=9, InterpolantAutomatonStates: 88, 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, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 22 NumberOfFragments, 607 HoareAnnotationTreeSize, 9 FormulaSimplifications, 135 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FormulaSimplificationsInter, 224 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 604 NumberOfCodeBlocks, 600 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 690 ConstructedInterpolants, 13 QuantifiedInterpolants, 6073 SizeOfPredicates, 66 NumberOfNonLiveVariables, 2167 ConjunctsInSsa, 312 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 416/482 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: 597]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: (((len <= 1) && (len == 2)) || ((2 == len) && (len == 2))) - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: (((len == 2) || ((i == 0) && (len == 2))) || ((len == 2) && (i <= 1))) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-21 03:48:21,728 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...