/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.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 03:47:31,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 03:47:32,027 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:32,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 03:47:32,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 03:47:32,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 03:47:32,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 03:47:32,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 03:47:32,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 03:47:32,043 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 03:47:32,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 03:47:32,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 03:47:32,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 03:47:32,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 03:47:32,044 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 03:47:32,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 03:47:32,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 03:47:32,045 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 03:47:32,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 03:47:32,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 03:47:32,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 03:47:32,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 03:47:32,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 03:47:32,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 03:47:32,046 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 03:47:32,047 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 03:47:32,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 03:47:32,047 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 03:47:32,047 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 03:47:32,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 03:47:32,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 03:47:32,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 03:47:32,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:47:32,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 03:47:32,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 03:47:32,049 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 03:47:32,049 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 03:47:32,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 03:47:32,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 03:47:32,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 03:47:32,049 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 03:47:32,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 03:47:32,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 03:47:32,050 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:32,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 03:47:32,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 03:47:32,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 03:47:32,230 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 03:47:32,230 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 03:47:32,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_remove_all.i [2023-12-21 03:47:33,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 03:47:33,444 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 03:47:33,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_remove_all.i [2023-12-21 03:47:33,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83f6199b7/93ce2c019903460ea91a69737fb24c23/FLAG51aeff7be [2023-12-21 03:47:33,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83f6199b7/93ce2c019903460ea91a69737fb24c23 [2023-12-21 03:47:33,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 03:47:33,472 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 03:47:33,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 03:47:33,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 03:47:33,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 03:47:33,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:47:33" (1/1) ... [2023-12-21 03:47:33,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60be1215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:33, skipping insertion in model container [2023-12-21 03:47:33,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:47:33" (1/1) ... [2023-12-21 03:47:33,512 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 03:47:33,705 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.i[24082,24095] [2023-12-21 03:47:33,708 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:47:33,713 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 03:47:33,739 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.i[24082,24095] [2023-12-21 03:47:33,740 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:47:33,775 INFO L206 MainTranslator]: Completed translation [2023-12-21 03:47:33,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:33 WrapperNode [2023-12-21 03:47:33,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 03:47:33,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 03:47:33,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 03:47:33,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 03:47:33,782 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:33" (1/1) ... [2023-12-21 03:47:33,790 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:33" (1/1) ... [2023-12-21 03:47:33,803 INFO L138 Inliner]: procedures = 126, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 112 [2023-12-21 03:47:33,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 03:47:33,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 03:47:33,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 03:47:33,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 03:47:33,810 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:33" (1/1) ... [2023-12-21 03:47:33,811 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:33" (1/1) ... [2023-12-21 03:47:33,813 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:33" (1/1) ... [2023-12-21 03:47:33,824 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 8, 10]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 7 writes are split as follows [0, 5, 2]. [2023-12-21 03:47:33,825 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:33" (1/1) ... [2023-12-21 03:47:33,825 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:33" (1/1) ... [2023-12-21 03:47:33,829 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:33" (1/1) ... [2023-12-21 03:47:33,831 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:33" (1/1) ... [2023-12-21 03:47:33,835 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:33" (1/1) ... [2023-12-21 03:47:33,836 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:33" (1/1) ... [2023-12-21 03:47:33,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 03:47:33,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 03:47:33,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 03:47:33,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 03:47:33,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:33" (1/1) ... [2023-12-21 03:47:33,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:47:33,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:47:33,870 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:33,903 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:33,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 03:47:33,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 03:47:33,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 03:47:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-21 03:47:33,914 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-21 03:47:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 03:47:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 03:47:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 03:47:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 03:47:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 03:47:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-21 03:47:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 03:47:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 03:47:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-21 03:47:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 03:47:33,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-21 03:47:33,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-21 03:47:33,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-21 03:47:33,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 03:47:33,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 03:47:33,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 03:47:33,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 03:47:33,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 03:47:34,021 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 03:47:34,023 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 03:47:34,152 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 03:47:34,184 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 03:47:34,185 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 03:47:34,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:47:34 BoogieIcfgContainer [2023-12-21 03:47:34,185 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 03:47:34,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 03:47:34,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 03:47:34,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 03:47:34,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:47:33" (1/3) ... [2023-12-21 03:47:34,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d7ff81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:47:34, skipping insertion in model container [2023-12-21 03:47:34,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:47:33" (2/3) ... [2023-12-21 03:47:34,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d7ff81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:47:34, skipping insertion in model container [2023-12-21 03:47:34,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:47:34" (3/3) ... [2023-12-21 03:47:34,191 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2023-12-21 03:47:34,208 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 03:47:34,209 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 03:47:34,237 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 03:47:34,241 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;@682b4dcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 03:47:34,241 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 03:47:34,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:47:34,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 03:47:34,248 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:47:34,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:47:34,249 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:47:34,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:47:34,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1934320213, now seen corresponding path program 1 times [2023-12-21 03:47:34,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:47:34,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142055083] [2023-12-21 03:47:34,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:34,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:47:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:34,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:47:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:34,474 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:34,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:47:34,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142055083] [2023-12-21 03:47:34,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142055083] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:47:34,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:47:34,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 03:47:34,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087514136] [2023-12-21 03:47:34,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:47:34,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 03:47:34,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:47:34,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 03:47:34,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:47:34,500 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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:47:34,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:47:34,540 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2023-12-21 03:47:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 03:47:34,542 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:47:34,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:47:34,546 INFO L225 Difference]: With dead ends: 36 [2023-12-21 03:47:34,546 INFO L226 Difference]: Without dead ends: 20 [2023-12-21 03:47:34,549 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:47:34,554 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:47:34,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:47:34,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-21 03:47:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-21 03:47:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-21 03:47:34,579 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2023-12-21 03:47:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:47:34,580 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-21 03:47:34,580 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:47:34,581 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-21 03:47:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 03:47:34,582 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:47:34,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:47:34,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 03:47:34,583 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:47:34,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:47:34,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2106839894, now seen corresponding path program 1 times [2023-12-21 03:47:34,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:47:34,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533815356] [2023-12-21 03:47:34,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:34,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:47:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:34,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:47:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:34,759 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:34,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:47:34,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533815356] [2023-12-21 03:47:34,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533815356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:47:34,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:47:34,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 03:47:34,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092753608] [2023-12-21 03:47:34,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:47:34,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:47:34,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:47:34,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:47:34,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:47:34,762 INFO L87 Difference]: Start difference. First operand 20 states and 24 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:47:34,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:47:34,794 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2023-12-21 03:47:34,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:47:34,795 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:47:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:47:34,795 INFO L225 Difference]: With dead ends: 34 [2023-12-21 03:47:34,795 INFO L226 Difference]: Without dead ends: 23 [2023-12-21 03:47:34,796 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:47:34,796 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:47:34,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:47:34,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-21 03:47:34,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-12-21 03:47:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:47:34,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-21 03:47:34,803 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2023-12-21 03:47:34,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:47:34,803 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-21 03:47:34,804 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:47:34,804 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-21 03:47:34,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-21 03:47:34,805 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:47:34,805 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:47:34,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 03:47:34,805 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:47:34,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:47:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2078188702, now seen corresponding path program 1 times [2023-12-21 03:47:34,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:47:34,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097695109] [2023-12-21 03:47:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:34,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:47:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:34,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:47:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:34,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:47:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:34,953 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:47:34,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:47:34,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097695109] [2023-12-21 03:47:34,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097695109] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:47:34,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:47:34,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 03:47:34,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522268738] [2023-12-21 03:47:34,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:47:34,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 03:47:34,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:47:34,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 03:47:34,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:47:34,955 INFO L87 Difference]: Start difference. First operand 21 states and 25 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:47:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:47:35,000 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2023-12-21 03:47:35,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:47:35,001 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:47:35,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:47:35,002 INFO L225 Difference]: With dead ends: 31 [2023-12-21 03:47:35,002 INFO L226 Difference]: Without dead ends: 27 [2023-12-21 03:47:35,003 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:47:35,005 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:47:35,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 42 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:47:35,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-21 03:47:35,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2023-12-21 03:47:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:47:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-12-21 03:47:35,014 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 18 [2023-12-21 03:47:35,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:47:35,014 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-12-21 03:47:35,015 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:47:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-12-21 03:47:35,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-21 03:47:35,015 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:47:35,016 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:47:35,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 03:47:35,016 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:47:35,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:47:35,017 INFO L85 PathProgramCache]: Analyzing trace with hash 503792656, now seen corresponding path program 1 times [2023-12-21 03:47:35,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:47:35,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127261582] [2023-12-21 03:47:35,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:35,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:47:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:35,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:47:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:35,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:47:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:35,156 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:47:35,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:47:35,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127261582] [2023-12-21 03:47:35,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127261582] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:47:35,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222147053] [2023-12-21 03:47:35,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:35,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:47:35,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:47:35,174 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:47:35,207 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:47:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:35,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 03:47:35,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:47:35,383 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:47:35,383 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:47:35,421 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:47:35,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222147053] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:47:35,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:47:35,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-12-21 03:47:35,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889483183] [2023-12-21 03:47:35,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:47:35,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 03:47:35,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:47:35,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 03:47:35,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-21 03:47:35,424 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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:47:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:47:35,458 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2023-12-21 03:47:35,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 03:47:35,458 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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 21 [2023-12-21 03:47:35,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:47:35,459 INFO L225 Difference]: With dead ends: 32 [2023-12-21 03:47:35,459 INFO L226 Difference]: Without dead ends: 28 [2023-12-21 03:47:35,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-21 03:47:35,460 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 50 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:47:35,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 53 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:47:35,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-21 03:47:35,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-21 03:47:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:47:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-12-21 03:47:35,465 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 21 [2023-12-21 03:47:35,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:47:35,466 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-12-21 03:47:35,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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:47:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-12-21 03:47:35,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-21 03:47:35,467 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:47:35,467 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:47:35,489 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:47:35,673 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:47:35,674 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:47:35,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:47:35,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1285941410, now seen corresponding path program 2 times [2023-12-21 03:47:35,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:47:35,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634589016] [2023-12-21 03:47:35,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:35,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:47:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:35,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:47:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:35,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:47:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:35,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:47:35,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:47:35,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634589016] [2023-12-21 03:47:35,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634589016] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:47:35,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:47:35,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 03:47:35,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767933369] [2023-12-21 03:47:35,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:47:35,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 03:47:35,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:47:35,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 03:47:35,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:47:35,955 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:47:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:47:36,041 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2023-12-21 03:47:36,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 03:47:36,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-12-21 03:47:36,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:47:36,042 INFO L225 Difference]: With dead ends: 40 [2023-12-21 03:47:36,043 INFO L226 Difference]: Without dead ends: 36 [2023-12-21 03:47:36,046 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:47:36,046 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:47:36,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 69 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:47:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-21 03:47:36,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2023-12-21 03:47:36,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:47:36,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-12-21 03:47:36,060 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2023-12-21 03:47:36,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:47:36,061 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-12-21 03:47:36,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:47:36,061 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-12-21 03:47:36,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 03:47:36,062 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:47:36,062 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:47:36,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 03:47:36,062 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:47:36,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:47:36,063 INFO L85 PathProgramCache]: Analyzing trace with hash 565204474, now seen corresponding path program 1 times [2023-12-21 03:47:36,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:47:36,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802035993] [2023-12-21 03:47:36,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:36,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:47:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:36,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:47:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:36,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:47:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:47:36,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:47:36,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802035993] [2023-12-21 03:47:36,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802035993] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:47:36,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:47:36,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 03:47:36,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189933837] [2023-12-21 03:47:36,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:47:36,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 03:47:36,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:47:36,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 03:47:36,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:47:36,381 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:47:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:47:36,454 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2023-12-21 03:47:36,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 03:47:36,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2023-12-21 03:47:36,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:47:36,455 INFO L225 Difference]: With dead ends: 45 [2023-12-21 03:47:36,455 INFO L226 Difference]: Without dead ends: 32 [2023-12-21 03:47:36,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:47:36,458 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:47:36,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:47:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-21 03:47:36,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-21 03:47:36,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-12-21 03:47:36,464 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 27 [2023-12-21 03:47:36,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:47:36,465 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-12-21 03:47:36,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:47:36,465 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-12-21 03:47:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 03:47:36,465 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:47:36,465 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:47:36,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 03:47:36,466 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:47:36,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:47:36,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1961812095, now seen corresponding path program 1 times [2023-12-21 03:47:36,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:47:36,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354876267] [2023-12-21 03:47:36,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:36,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:47:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:36,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:47:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:36,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:47:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:47:37,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:47:37,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354876267] [2023-12-21 03:47:37,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354876267] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:47:37,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662807774] [2023-12-21 03:47:37,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:37,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:47:37,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:47:37,021 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:47:37,040 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:47:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:37,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-21 03:47:37,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:47:37,258 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:47:37,344 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-21 03:47:37,344 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:47:37,376 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:47:37,420 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-12-21 03:47:37,421 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 53 treesize of output 46 [2023-12-21 03:47:37,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2023-12-21 03:47:37,449 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 24 treesize of output 8 [2023-12-21 03:47:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 03:47:37,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:47:37,488 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 32 treesize of output 20 [2023-12-21 03:47:37,492 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 24 treesize of output 16 [2023-12-21 03:47:37,499 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_542 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_542) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) is different from false [2023-12-21 03:47:37,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:47:37,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-12-21 03:47:37,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-12-21 03:47:37,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-21 03:47:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2023-12-21 03:47:37,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662807774] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:47:37,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:47:37,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 28 [2023-12-21 03:47:37,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139327765] [2023-12-21 03:47:37,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:47:37,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-21 03:47:37,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:47:37,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-21 03:47:37,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=630, Unknown=1, NotChecked=50, Total=756 [2023-12-21 03:47:37,736 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 28 states, 24 states have (on average 1.75) internal successors, (42), 19 states have internal predecessors, (42), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-21 03:47:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:47:38,017 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2023-12-21 03:47:38,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 03:47:38,017 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 1.75) internal successors, (42), 19 states have internal predecessors, (42), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2023-12-21 03:47:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:47:38,019 INFO L225 Difference]: With dead ends: 58 [2023-12-21 03:47:38,019 INFO L226 Difference]: Without dead ends: 44 [2023-12-21 03:47:38,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=828, Unknown=1, NotChecked=58, Total=992 [2023-12-21 03:47:38,020 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 36 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 03:47:38,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 203 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 288 Invalid, 0 Unknown, 32 Unchecked, 0.2s Time] [2023-12-21 03:47:38,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-21 03:47:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2023-12-21 03:47:38,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 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:47:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2023-12-21 03:47:38,026 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 29 [2023-12-21 03:47:38,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:47:38,026 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2023-12-21 03:47:38,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 1.75) internal successors, (42), 19 states have internal predecessors, (42), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-21 03:47:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2023-12-21 03:47:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 03:47:38,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:47:38,027 INFO L195 NwaCegarLoop]: trace histogram [4, 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:47:38,033 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:47:38,227 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:47:38,230 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:47:38,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:47:38,230 INFO L85 PathProgramCache]: Analyzing trace with hash 863445628, now seen corresponding path program 1 times [2023-12-21 03:47:38,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:47:38,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439973247] [2023-12-21 03:47:38,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:38,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:47:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:38,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:47:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:38,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:47:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 03:47:38,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:47:38,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439973247] [2023-12-21 03:47:38,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439973247] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:47:38,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055048883] [2023-12-21 03:47:38,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:38,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:47:38,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:47:38,703 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:47:38,746 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:47:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:38,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-21 03:47:38,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:47:39,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 121 [2023-12-21 03:47:39,030 INFO L349 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2023-12-21 03:47:39,030 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 102 treesize of output 64 [2023-12-21 03:47:39,041 INFO L349 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2023-12-21 03:47:39,042 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 78 treesize of output 52 [2023-12-21 03:47:39,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 61 [2023-12-21 03:47:39,147 INFO L349 Elim1Store]: treesize reduction 46, result has 6.1 percent of original size [2023-12-21 03:47:39,147 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 35 [2023-12-21 03:47:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 03:47:39,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:47:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 03:47:39,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055048883] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:47:39,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:47:39,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 20 [2023-12-21 03:47:39,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317823959] [2023-12-21 03:47:39,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:47:39,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-21 03:47:39,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:47:39,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-21 03:47:39,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2023-12-21 03:47:39,323 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 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:47:39,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:47:39,735 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2023-12-21 03:47:39,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 03:47:39,736 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 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 34 [2023-12-21 03:47:39,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:47:39,737 INFO L225 Difference]: With dead ends: 68 [2023-12-21 03:47:39,737 INFO L226 Difference]: Without dead ends: 54 [2023-12-21 03:47:39,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2023-12-21 03:47:39,737 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 03:47:39,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 146 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 03:47:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-21 03:47:39,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2023-12-21 03:47:39,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 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:47:39,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2023-12-21 03:47:39,743 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 34 [2023-12-21 03:47:39,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:47:39,743 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2023-12-21 03:47:39,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 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:47:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2023-12-21 03:47:39,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-21 03:47:39,744 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:47:39,744 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:47:39,749 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:47:39,944 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:47:39,945 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:47:39,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:47:39,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2028261131, now seen corresponding path program 2 times [2023-12-21 03:47:39,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:47:39,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331303550] [2023-12-21 03:47:39,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:39,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:47:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:40,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:47:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:40,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:47:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:40,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 03:47:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:40,054 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-21 03:47:40,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:47:40,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331303550] [2023-12-21 03:47:40,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331303550] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:47:40,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634408278] [2023-12-21 03:47:40,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:47:40,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:47:40,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:47:40,059 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:47:40,081 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:47:40,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:47:40,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:47:40,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 03:47:40,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:47:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:47:40,240 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 03:47:40,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634408278] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:47:40,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 03:47:40,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-12-21 03:47:40,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699341707] [2023-12-21 03:47:40,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:47:40,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:47:40,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:47:40,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:47:40,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:47:40,243 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 03:47:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:47:40,263 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2023-12-21 03:47:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:47:40,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2023-12-21 03:47:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:47:40,264 INFO L225 Difference]: With dead ends: 82 [2023-12-21 03:47:40,264 INFO L226 Difference]: Without dead ends: 43 [2023-12-21 03:47:40,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:47:40,264 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:47:40,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:47:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-21 03:47:40,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-21 03:47:40,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 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:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-12-21 03:47:40,270 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 35 [2023-12-21 03:47:40,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:47:40,271 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-12-21 03:47:40,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 03:47:40,271 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2023-12-21 03:47:40,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 03:47:40,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:47:40,272 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 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:47:40,278 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:47:40,478 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:47:40,479 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:47:40,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:47:40,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1571610815, now seen corresponding path program 2 times [2023-12-21 03:47:40,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:47:40,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090430363] [2023-12-21 03:47:40,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:40,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:47:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:41,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:47:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:41,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:47:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 03:47:41,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:47:41,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090430363] [2023-12-21 03:47:41,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090430363] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:47:41,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269330585] [2023-12-21 03:47:41,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:47:41,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:47:41,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:47:41,376 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:47:41,392 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:47:41,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:47:41,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:47:41,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 105 conjunts are in the unsatisfiable core [2023-12-21 03:47:41,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:47:41,597 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:47:41,712 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-21 03:47:41,713 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:47:41,749 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:47:41,757 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:47:41,812 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-21 03:47:41,812 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:47:41,818 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:47:41,916 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-21 03:47:42,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:47:42,066 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 03:47:42,066 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 03:47:42,070 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-21 03:47:42,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 31 [2023-12-21 03:47:42,113 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 62 treesize of output 38 [2023-12-21 03:47:42,121 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-12-21 03:47:42,121 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 20 [2023-12-21 03:47:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:47:42,148 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:47:42,293 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 133 treesize of output 109 [2023-12-21 03:47:42,294 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 113 treesize of output 93 [2023-12-21 03:47:42,568 INFO L349 Elim1Store]: treesize reduction 1506, result has 34.1 percent of original size [2023-12-21 03:47:42,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 18988 treesize of output 16064 [2023-12-21 03:47:42,805 INFO L349 Elim1Store]: treesize reduction 11, result has 60.7 percent of original size [2023-12-21 03:47:42,805 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 10828 treesize of output 10420 [2023-12-21 03:47:46,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269330585] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:47:46,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:47:46,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2023-12-21 03:47:46,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613999569] [2023-12-21 03:47:46,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:47:46,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-21 03:47:46,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:47:46,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-21 03:47:46,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1233, Unknown=0, NotChecked=0, Total=1332 [2023-12-21 03:47:46,751 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 29 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 23 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 03:47:47,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:47:47,154 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2023-12-21 03:47:47,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 03:47:47,155 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 23 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2023-12-21 03:47:47,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:47:47,155 INFO L225 Difference]: With dead ends: 66 [2023-12-21 03:47:47,155 INFO L226 Difference]: Without dead ends: 45 [2023-12-21 03:47:47,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=161, Invalid=1645, Unknown=0, NotChecked=0, Total=1806 [2023-12-21 03:47:47,157 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 03:47:47,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 183 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 03:47:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-21 03:47:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-21 03:47:47,161 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:47:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2023-12-21 03:47:47,162 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 36 [2023-12-21 03:47:47,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:47:47,162 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2023-12-21 03:47:47,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 23 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 03:47:47,162 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2023-12-21 03:47:47,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-21 03:47:47,163 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:47:47,163 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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:47:47,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-21 03:47:47,369 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:47:47,369 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:47:47,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:47:47,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1626364240, now seen corresponding path program 3 times [2023-12-21 03:47:47,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:47:47,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465289117] [2023-12-21 03:47:47,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:47,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:47:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:47,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:47:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:47,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:47:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 03:47:47,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:47:47,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465289117] [2023-12-21 03:47:47,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465289117] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:47:47,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514361444] [2023-12-21 03:47:47,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 03:47:47,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:47:47,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:47:47,461 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:47:47,463 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:47:47,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-21 03:47:47,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:47:47,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 03:47:47,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:47:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 03:47:47,887 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 03:47:47,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514361444] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:47:47,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 03:47:47,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2023-12-21 03:47:47,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506087058] [2023-12-21 03:47:47,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:47:47,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 03:47:47,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:47:47,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 03:47:47,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-21 03:47:47,889 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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:47:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:47:47,911 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2023-12-21 03:47:47,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 03:47:47,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 37 [2023-12-21 03:47:47,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:47:47,912 INFO L225 Difference]: With dead ends: 67 [2023-12-21 03:47:47,912 INFO L226 Difference]: Without dead ends: 41 [2023-12-21 03:47:47,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-21 03:47:47,913 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:47:47,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:47:47,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-21 03:47:47,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2023-12-21 03:47:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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:47,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2023-12-21 03:47:47,918 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 37 [2023-12-21 03:47:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:47:47,919 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2023-12-21 03:47:47,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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:47:47,919 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2023-12-21 03:47:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-21 03:47:47,919 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:47:47,919 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 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:47:47,926 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:47:48,121 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:47:48,121 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:47:48,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:47:48,122 INFO L85 PathProgramCache]: Analyzing trace with hash -903676218, now seen corresponding path program 3 times [2023-12-21 03:47:48,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:47:48,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330383171] [2023-12-21 03:47:48,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:47:48,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:47:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:48,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:47:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:48,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:47:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:47:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-21 03:47:48,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:47:48,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330383171] [2023-12-21 03:47:48,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330383171] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:47:48,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226559769] [2023-12-21 03:47:48,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 03:47:48,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:47:48,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:47:48,820 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:47:48,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-21 03:47:49,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-21 03:47:49,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:47:49,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 143 conjunts are in the unsatisfiable core [2023-12-21 03:47:49,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:47:49,474 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:47:49,639 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-21 03:47:49,639 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:47:49,671 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:47:49,674 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:47:49,726 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-21 03:47:49,726 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:47:49,732 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:47:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-21 03:47:50,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:47:51,128 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 497 treesize of output 425 [2023-12-21 03:47:51,131 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 429 treesize of output 357 [2023-12-21 03:47:51,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:47:51,298 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 4127 treesize of output 3815 [2023-12-21 03:47:51,458 INFO L349 Elim1Store]: treesize reduction 22, result has 85.7 percent of original size [2023-12-21 03:47:51,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 3024 treesize of output 3067 [2023-12-21 03:47:52,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226559769] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:47:52,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:47:52,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2023-12-21 03:47:52,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826462048] [2023-12-21 03:47:52,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:47:52,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-21 03:47:52,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:47:52,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-21 03:47:52,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1729, Unknown=0, NotChecked=0, Total=1892 [2023-12-21 03:47:52,844 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 31 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 25 states have internal predecessors, (43), 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:47:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:47:53,031 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2023-12-21 03:47:53,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 03:47:53,031 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 25 states have internal predecessors, (43), 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 38 [2023-12-21 03:47:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:47:53,031 INFO L225 Difference]: With dead ends: 36 [2023-12-21 03:47:53,031 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 03:47:53,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=180, Invalid=1890, Unknown=0, NotChecked=0, Total=2070 [2023-12-21 03:47:53,033 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:47:53,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 70 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:47:53,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 03:47:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 03:47:53,034 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:47:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 03:47:53,034 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2023-12-21 03:47:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:47:53,034 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 03:47:53,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 25 states have internal predecessors, (43), 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:47:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 03:47:53,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 03:47:53,036 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 03:47:53,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-21 03:47:53,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:47:53,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 03:47:53,483 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 608) no Hoare annotation was computed. [2023-12-21 03:47:53,484 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 610 625) no Hoare annotation was computed. [2023-12-21 03:47:53,484 INFO L899 garLoopResultBuilder]: For program point L602-1(lines 602 604) no Hoare annotation was computed. [2023-12-21 03:47:53,484 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 623) no Hoare annotation was computed. [2023-12-21 03:47:53,484 INFO L895 garLoopResultBuilder]: At program point L602-3(lines 602 604) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 0))) (let ((.cse14 (select |#memory_$Pointer$#1.base| .cse1)) (.cse12 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (= |ULTIMATE.start_main_~i~0#1| 0)) (.cse8 (select (select |#memory_$Pointer$#1.base| .cse12) 0)) (.cse4 (= (select (select |#memory_$Pointer$#1.offset| .cse12) 0) 0)) (.cse5 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse10 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|)) (.cse11 (= |ULTIMATE.start_sll_circular_remove_first_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select .cse14 0)) (.cse0 (select |#memory_$Pointer$#1.offset| .cse1)) (.cse9 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_remove_first_~head#1.base|) 0))) (or (and (= (select .cse0 0) |ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|) (not (= .cse1 .cse2)) (= |ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset| 0) .cse3 (= |ULTIMATE.start_sll_circular_remove_first_~temp~1#1.base| .cse2) (= .cse1 |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) .cse4 .cse5 .cse6 .cse7 (= (select (select |#memory_$Pointer$#1.offset| .cse8) 0) 0) (= .cse9 0) (= .cse1 (select (select |#memory_$Pointer$#1.base| (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) 0)) (select .cse10 0))) .cse11) (let ((.cse13 (select .cse0 .cse9))) (and .cse3 (not (= .cse12 .cse8)) (= |ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset| .cse13) (= .cse12 (select (select |#memory_$Pointer$#1.base| .cse8) 0)) (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) .cse4 (= (select .cse14 .cse9) |ULTIMATE.start_sll_circular_remove_first_~temp~1#1.base|) .cse5 .cse6 .cse7 (= (select .cse10 |ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset|) .cse9) .cse11 (= |ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset| .cse13) (= |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| .cse2))))))) [2023-12-21 03:47:53,484 INFO L899 garLoopResultBuilder]: For program point L602-4(lines 602 604) no Hoare annotation was computed. [2023-12-21 03:47:53,484 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 621) no Hoare annotation was computed. [2023-12-21 03:47:53,484 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)) (.cse4 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse2 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) .cse0 .cse1 (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) .cse2 .cse3 (not .cse4)) (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) .cse4 .cse2 .cse3))) [2023-12-21 03:47:53,484 INFO L899 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2023-12-21 03:47:53,486 INFO L895 garLoopResultBuilder]: At program point L615-2(lines 615 618) the Hoare annotation is: (let ((.cse8 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse0 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |#memory_$Pointer$#1.base| .cse0)) (.cse3 (select |#memory_$Pointer$#1.offset| .cse0)) (.cse2 (= .cse8 0)) (.cse4 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (let ((.cse1 (select .cse6 0))) (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= .cse0 .cse1)) (= .cse0 (select (select |#memory_$Pointer$#1.base| .cse1) 0)) .cse2 (= (select .cse3 0) 0) .cse4 .cse5 (= (select (select |#memory_$Pointer$#1.offset| .cse1) 0) 0))) (and (= |ULTIMATE.start_main_~i~0#1| 1) .cse4 .cse5 (exists ((v_arrayElimCell_13 Int) (v_arrayElimCell_10 Int)) (let ((.cse7 (select (select |#memory_$Pointer$#1.offset| v_arrayElimCell_10) v_arrayElimCell_13))) (and (= (select (select |#memory_$Pointer$#1.base| v_arrayElimCell_10) v_arrayElimCell_13) .cse0) (= .cse0 (select .cse6 .cse7)) (= .cse7 (select .cse3 .cse7)) (= .cse7 .cse8))))) (and .cse2 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse4 .cse5 (= .cse0 0))))) [2023-12-21 03:47:53,486 INFO L899 garLoopResultBuilder]: For program point L615-3(lines 615 618) no Hoare annotation was computed. [2023-12-21 03:47:53,486 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 03:47:53,486 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 609) no Hoare annotation was computed. [2023-12-21 03:47:53,486 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 |#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:47:53,486 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2023-12-21 03:47:53,486 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 03:47:53,487 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 610 625) no Hoare annotation was computed. [2023-12-21 03:47:53,487 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:47:53,487 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2023-12-21 03:47:53,487 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-21 03:47:53,487 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-21 03:47:53,488 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) [2023-12-21 03:47:53,488 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-12-21 03:47:53,490 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1] [2023-12-21 03:47:53,491 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 03:47:53,507 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-12-21 03:47:53,508 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated [2023-12-21 03:47:53,508 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-12-21 03:47:53,508 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][0]][0] could not be translated [2023-12-21 03:47:53,508 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-12-21 03:47:53,508 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated [2023-12-21 03:47:53,508 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][0]][0] could not be translated [2023-12-21 03:47:53,508 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_13 : int, v_arrayElimCell_10 : int :: ((#memory_$Pointer$#1.base[v_arrayElimCell_10][v_arrayElimCell_13] == #memory_$Pointer$#2.base[~#s~0!base][0] && #memory_$Pointer$#2.base[~#s~0!base][0] == #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][#memory_$Pointer$#1.offset[v_arrayElimCell_10][v_arrayElimCell_13]]) && #memory_$Pointer$#1.offset[v_arrayElimCell_10][v_arrayElimCell_13] == #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][#memory_$Pointer$#1.offset[v_arrayElimCell_10][v_arrayElimCell_13]]) && #memory_$Pointer$#1.offset[v_arrayElimCell_10][v_arrayElimCell_13] == #memory_$Pointer$#2.offset[~#s~0!base][0]) could not be translated [2023-12-21 03:47:53,508 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-12-21 03:47:53,508 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-12-21 03:47:53,510 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~head!base][0]][0] could not be translated [2023-12-21 03:47:53,510 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head!base][0] could not be translated [2023-12-21 03:47:53,510 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~head!base][0]][0] could not be translated [2023-12-21 03:47:53,510 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~head!base][0]][0] could not be translated [2023-12-21 03:47:53,511 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head!base][0] could not be translated [2023-12-21 03:47:53,511 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated [2023-12-21 03:47:53,511 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:47:53,511 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][0]][0] could not be translated [2023-12-21 03:47:53,511 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head!base][0] could not be translated [2023-12-21 03:47:53,511 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head!base][0] could not be translated [2023-12-21 03:47:53,511 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~last~1!base][0]][#memory_$Pointer$#1.offset[~last~1!base][0]] could not be translated [2023-12-21 03:47:53,511 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:47:53,511 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-12-21 03:47:53,511 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated [2023-12-21 03:47:53,511 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~head!base][0]][#memory_$Pointer$#2.offset[~head!base][0]] could not be translated [2023-12-21 03:47:53,512 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-12-21 03:47:53,512 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][0]][0] could not be translated [2023-12-21 03:47:53,512 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-12-21 03:47:53,512 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated [2023-12-21 03:47:53,512 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~head!base][0]][#memory_$Pointer$#2.offset[~head!base][0]] could not be translated [2023-12-21 03:47:53,512 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:47:53,512 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~last~1!base][~last~1!offset] could not be translated [2023-12-21 03:47:53,512 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head!base][0] could not be translated [2023-12-21 03:47:53,512 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-21 03:47:53,512 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~head!base][0]][#memory_$Pointer$#2.offset[~head!base][0]] could not be translated [2023-12-21 03:47:53,512 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~head!base][0]][0] could not be translated [2023-12-21 03:47:53,513 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][0] could not be translated [2023-12-21 03:47:53,513 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][0] could not be translated [2023-12-21 03:47:53,513 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-21 03:47:53,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:47:53 BoogieIcfgContainer [2023-12-21 03:47:53,514 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 03:47:53,514 INFO L158 Benchmark]: Toolchain (without parser) took 20041.64ms. Allocated memory was 203.4MB in the beginning and 830.5MB in the end (delta: 627.0MB). Free memory was 138.4MB in the beginning and 716.3MB in the end (delta: -577.8MB). Peak memory consumption was 50.2MB. Max. memory is 8.0GB. [2023-12-21 03:47:53,514 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory was 153.2MB in the beginning and 153.1MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 03:47:53,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.53ms. Allocated memory was 203.4MB in the beginning and 287.3MB in the end (delta: 83.9MB). Free memory was 138.2MB in the beginning and 253.7MB in the end (delta: -115.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-21 03:47:53,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.86ms. Allocated memory is still 287.3MB. Free memory was 253.7MB in the beginning and 251.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:47:53,515 INFO L158 Benchmark]: Boogie Preprocessor took 33.79ms. Allocated memory is still 287.3MB. Free memory was 251.6MB in the beginning and 249.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:47:53,515 INFO L158 Benchmark]: RCFGBuilder took 346.92ms. Allocated memory is still 287.3MB. Free memory was 248.5MB in the beginning and 230.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-21 03:47:53,515 INFO L158 Benchmark]: TraceAbstraction took 19327.13ms. Allocated memory was 287.3MB in the beginning and 830.5MB in the end (delta: 543.2MB). Free memory was 230.2MB in the beginning and 716.3MB in the end (delta: -486.1MB). Peak memory consumption was 57.6MB. Max. memory is 8.0GB. [2023-12-21 03:47:53,516 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 203.4MB. Free memory was 153.2MB in the beginning and 153.1MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 302.53ms. Allocated memory was 203.4MB in the beginning and 287.3MB in the end (delta: 83.9MB). Free memory was 138.2MB in the beginning and 253.7MB in the end (delta: -115.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.86ms. Allocated memory is still 287.3MB. Free memory was 253.7MB in the beginning and 251.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.79ms. Allocated memory is still 287.3MB. Free memory was 251.6MB in the beginning and 249.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 346.92ms. Allocated memory is still 287.3MB. Free memory was 248.5MB in the beginning and 230.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 19327.13ms. Allocated memory was 287.3MB in the beginning and 830.5MB in the end (delta: 543.2MB). Free memory was 230.2MB in the beginning and 716.3MB in the end (delta: -486.1MB). Peak memory consumption was 57.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_13 : int, v_arrayElimCell_10 : int :: ((#memory_$Pointer$#1.base[v_arrayElimCell_10][v_arrayElimCell_13] == #memory_$Pointer$#2.base[~#s~0!base][0] && #memory_$Pointer$#2.base[~#s~0!base][0] == #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][#memory_$Pointer$#1.offset[v_arrayElimCell_10][v_arrayElimCell_13]]) && #memory_$Pointer$#1.offset[v_arrayElimCell_10][v_arrayElimCell_13] == #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][#memory_$Pointer$#1.offset[v_arrayElimCell_10][v_arrayElimCell_13]]) && #memory_$Pointer$#1.offset[v_arrayElimCell_10][v_arrayElimCell_13] == #memory_$Pointer$#2.offset[~#s~0!base][0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~head!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~head!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~head!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][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.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~last~1!base][0]][#memory_$Pointer$#1.offset[~last~1!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.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~head!base][0]][#memory_$Pointer$#2.offset[~head!base][0]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~head!base][0]][#memory_$Pointer$#2.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.offset[~last~1!base][~last~1!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.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$#1.offset[#memory_$Pointer$#2.base[~head!base][0]][#memory_$Pointer$#2.offset[~head!base][0]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~head!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated * 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: 623]: 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, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 1003 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 32 IncrementalHoareTripleChecker+Unchecked, 811 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1344 IncrementalHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 192 mSDtfsCounter, 1344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 325 SyntacticMatches, 3 SemanticMatches, 175 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=8, InterpolantAutomatonStates: 94, 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, 12 MinimizatonAttempts, 31 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 537 HoareAnnotationTreeSize, 8 FormulaSimplifications, 365 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FormulaSimplificationsInter, 223 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 553 NumberOfCodeBlocks, 553 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 615 ConstructedInterpolants, 6 QuantifiedInterpolants, 6261 SizeOfPredicates, 78 NumberOfNonLiveVariables, 2481 ConjunctsInSsa, 379 ConjunctsInUnsatCore, 22 InterpolantComputations, 7 PerfectInterpolantSequences, 318/376 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: 615]: Loop Invariant Derived loop invariant: ((((i == 0) && (len == 2)) || ((i == 1) && (len == 2))) || ((2 <= i) && (len == 2))) - InvariantResult [Line: 602]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: (((len <= 1) && (len == 2)) || ((2 == len) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2023-12-21 03:47:53,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...