/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/sll2c_append_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:54:34,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:54:34,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:54:34,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:54:34,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:54:34,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:54:34,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:54:34,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:54:34,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:54:34,815 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:54:34,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:54:34,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:54:34,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:54:34,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:54:34,816 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:54:34,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:54:34,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:54:34,817 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:54:34,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:54:34,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:54:34,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:54:34,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:54:34,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:54:34,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:54:34,823 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:54:34,823 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:54:34,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:54:34,824 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:54:34,824 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:54:34,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:54:34,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:54:34,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:54:34,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:54:34,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:54:34,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:54:34,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:54:34,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:54:34,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:54:34,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:54:34,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:54:34,826 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:54:34,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:54:34,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:54:34,826 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:54:35,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:54:35,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:54:35,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:54:35,022 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:54:35,023 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:54:35,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_append_equal.i [2023-12-15 21:54:36,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:54:36,313 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:54:36,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_append_equal.i [2023-12-15 21:54:36,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a57e0f691/b1f0fcb1a63544b18fe90dbf3221f91a/FLAG0755ed28c [2023-12-15 21:54:36,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a57e0f691/b1f0fcb1a63544b18fe90dbf3221f91a [2023-12-15 21:54:36,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:54:36,343 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:54:36,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:54:36,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:54:36,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:54:36,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:54:36" (1/1) ... [2023-12-15 21:54:36,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6a75be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:36, skipping insertion in model container [2023-12-15 21:54:36,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:54:36" (1/1) ... [2023-12-15 21:54:36,384 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:54:36,594 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_append_equal.i[24433,24446] [2023-12-15 21:54:36,601 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:54:36,609 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:54:36,639 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_append_equal.i[24433,24446] [2023-12-15 21:54:36,639 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:54:36,656 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:54:36,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:36 WrapperNode [2023-12-15 21:54:36,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:54:36,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:54:36,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:54:36,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:54:36,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:36" (1/1) ... [2023-12-15 21:54:36,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:36" (1/1) ... [2023-12-15 21:54:36,692 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2023-12-15 21:54:36,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:54:36,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:54:36,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:54:36,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:54:36,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:36" (1/1) ... [2023-12-15 21:54:36,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:36" (1/1) ... [2023-12-15 21:54:36,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:36" (1/1) ... [2023-12-15 21:54:36,719 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 9, 13]. 54 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 1, 7]. [2023-12-15 21:54:36,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:36" (1/1) ... [2023-12-15 21:54:36,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:36" (1/1) ... [2023-12-15 21:54:36,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:36" (1/1) ... [2023-12-15 21:54:36,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:36" (1/1) ... [2023-12-15 21:54:36,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:36" (1/1) ... [2023-12-15 21:54:36,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:36" (1/1) ... [2023-12-15 21:54:36,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:54:36,735 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:54:36,735 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:54:36,735 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:54:36,735 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:36" (1/1) ... [2023-12-15 21:54:36,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:54:36,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:36,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:54:36,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:54:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:54:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:54:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:54:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:54:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:54:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:54:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-15 21:54:36,785 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-15 21:54:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:54:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:54:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-15 21:54:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:54:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:54:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-15 21:54:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:54:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:54:36,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-15 21:54:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 21:54:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-15 21:54:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-15 21:54:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-15 21:54:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:54:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:54:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:54:36,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:54:36,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:54:36,877 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:54:36,879 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:54:37,108 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:54:37,129 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:54:37,129 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-15 21:54:37,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:54:37 BoogieIcfgContainer [2023-12-15 21:54:37,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:54:37,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:54:37,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:54:37,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:54:37,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:54:36" (1/3) ... [2023-12-15 21:54:37,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb39e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:54:37, skipping insertion in model container [2023-12-15 21:54:37,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:36" (2/3) ... [2023-12-15 21:54:37,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb39e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:54:37, skipping insertion in model container [2023-12-15 21:54:37,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:54:37" (3/3) ... [2023-12-15 21:54:37,141 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2023-12-15 21:54:37,153 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:54:37,153 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:54:37,197 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:54:37,202 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;@31363aad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:54:37,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:54:37,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:54:37,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-15 21:54:37,217 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:37,217 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:37,218 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:37,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:37,223 INFO L85 PathProgramCache]: Analyzing trace with hash 383461057, now seen corresponding path program 1 times [2023-12-15 21:54:37,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:37,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993867197] [2023-12-15 21:54:37,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:37,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:37,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:37,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:54:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:54:37,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:37,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993867197] [2023-12-15 21:54:37,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993867197] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:37,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:37,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:54:37,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093458908] [2023-12-15 21:54:37,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:37,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:54:37,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:37,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:54:37,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:54:37,528 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 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) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:54:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:37,573 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2023-12-15 21:54:37,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:54:37,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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) Word has length 18 [2023-12-15 21:54:37,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:37,579 INFO L225 Difference]: With dead ends: 54 [2023-12-15 21:54:37,579 INFO L226 Difference]: Without dead ends: 23 [2023-12-15 21:54:37,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:54:37,584 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:37,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:37,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-15 21:54:37,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-15 21:54:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:54:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-12-15 21:54:37,610 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2023-12-15 21:54:37,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:37,611 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-12-15 21:54:37,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:54:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-12-15 21:54:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-15 21:54:37,612 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:37,612 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:37,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:54:37,613 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:37,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:37,613 INFO L85 PathProgramCache]: Analyzing trace with hash -391035257, now seen corresponding path program 1 times [2023-12-15 21:54:37,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:37,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868073493] [2023-12-15 21:54:37,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:37,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:37,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:37,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:54:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:54:37,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:37,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868073493] [2023-12-15 21:54:37,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868073493] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:37,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:37,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:54:37,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52655680] [2023-12-15 21:54:37,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:37,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:54:37,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:37,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:54:37,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:54:37,770 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:54:37,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:37,815 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2023-12-15 21:54:37,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:54:37,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 18 [2023-12-15 21:54:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:37,817 INFO L225 Difference]: With dead ends: 43 [2023-12-15 21:54:37,817 INFO L226 Difference]: Without dead ends: 26 [2023-12-15 21:54:37,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:54:37,819 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:37,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-15 21:54:37,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-12-15 21:54:37,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:54:37,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-12-15 21:54:37,827 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 18 [2023-12-15 21:54:37,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:37,827 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-12-15 21:54:37,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:54:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-12-15 21:54:37,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-15 21:54:37,828 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:37,828 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:37,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:54:37,829 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:37,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:37,829 INFO L85 PathProgramCache]: Analyzing trace with hash 620466046, now seen corresponding path program 1 times [2023-12-15 21:54:37,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:37,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805115050] [2023-12-15 21:54:37,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:37,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:38,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:38,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:54:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:38,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:54:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 21:54:38,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:38,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805115050] [2023-12-15 21:54:38,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805115050] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:38,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295631547] [2023-12-15 21:54:38,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:38,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:38,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:38,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:54:38,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:54:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:38,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-15 21:54:38,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:38,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-15 21:54:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:54:38,587 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:38,628 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 8 treesize of output 4 [2023-12-15 21:54:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 21:54:38,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295631547] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:38,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:38,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2023-12-15 21:54:38,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277309702] [2023-12-15 21:54:38,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:38,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-15 21:54:38,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:38,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-15 21:54:38,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:54:38,655 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-15 21:54:42,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-15 21:54:46,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-15 21:54:50,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-15 21:54:54,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-15 21:54:58,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-15 21:54:58,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:58,901 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2023-12-15 21:54:58,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 21:54:58,902 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 24 [2023-12-15 21:54:58,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:58,902 INFO L225 Difference]: With dead ends: 36 [2023-12-15 21:54:58,902 INFO L226 Difference]: Without dead ends: 29 [2023-12-15 21:54:58,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2023-12-15 21:54:58,903 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 44 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:58,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 202 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2023-12-15 21:54:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-15 21:54:58,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-12-15 21:54:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:54:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-12-15 21:54:58,907 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 24 [2023-12-15 21:54:58,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:58,907 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-12-15 21:54:58,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-15 21:54:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-12-15 21:54:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-15 21:54:58,908 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:58,908 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:58,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 21:54:59,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:59,113 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:59,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:59,113 INFO L85 PathProgramCache]: Analyzing trace with hash 724565085, now seen corresponding path program 1 times [2023-12-15 21:54:59,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:59,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020721649] [2023-12-15 21:54:59,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:59,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:59,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:59,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:54:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:59,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:54:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:54:59,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:59,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020721649] [2023-12-15 21:54:59,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020721649] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:59,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68397687] [2023-12-15 21:54:59,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:59,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:59,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:59,875 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:54:59,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 21:55:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:00,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 107 conjunts are in the unsatisfiable core [2023-12-15 21:55:00,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:00,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-15 21:55:00,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:55:00,444 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-15 21:55:00,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-15 21:55:00,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-15 21:55:00,579 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 20 treesize of output 15 [2023-12-15 21:55:00,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-15 21:55:00,640 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 11 treesize of output 3 [2023-12-15 21:55:00,768 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-15 21:55:00,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-12-15 21:55:00,776 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 20 treesize of output 15 [2023-12-15 21:55:00,986 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 59 treesize of output 26 [2023-12-15 21:55:00,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-15 21:55:01,037 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 19 treesize of output 11 [2023-12-15 21:55:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:55:01,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:55:01,197 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_467 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (or (not (= v_ArrVal_466 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_466 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_466) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_467) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-12-15 21:55:01,240 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_467 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_466) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_467) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_466 (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_466 .cse1)))))))) is different from false [2023-12-15 21:55:01,250 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_467 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= v_ArrVal_466 (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_466 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_466) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_467) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2023-12-15 21:55:01,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68397687] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:01,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:55:01,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 37 [2023-12-15 21:55:01,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989390588] [2023-12-15 21:55:01,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:55:01,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-15 21:55:01,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:01,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-15 21:55:01,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1533, Unknown=3, NotChecked=240, Total=1892 [2023-12-15 21:55:01,342 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 37 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-15 21:55:02,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:02,234 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2023-12-15 21:55:02,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-15 21:55:02,235 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2023-12-15 21:55:02,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:02,235 INFO L225 Difference]: With dead ends: 39 [2023-12-15 21:55:02,235 INFO L226 Difference]: Without dead ends: 31 [2023-12-15 21:55:02,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=251, Invalid=2728, Unknown=3, NotChecked=324, Total=3306 [2023-12-15 21:55:02,237 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:02,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 252 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:55:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-15 21:55:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-12-15 21:55:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:55:02,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-12-15 21:55:02,241 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 27 [2023-12-15 21:55:02,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:02,241 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-12-15 21:55:02,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-15 21:55:02,241 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-12-15 21:55:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-15 21:55:02,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:02,242 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:02,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 21:55:02,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-15 21:55:02,448 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:02,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:02,448 INFO L85 PathProgramCache]: Analyzing trace with hash 80578008, now seen corresponding path program 1 times [2023-12-15 21:55:02,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:02,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980402470] [2023-12-15 21:55:02,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:02,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:03,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:03,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:55:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:03,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:55:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:55:03,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:03,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980402470] [2023-12-15 21:55:03,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980402470] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:03,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968722473] [2023-12-15 21:55:03,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:03,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:03,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:03,582 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:55:03,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 21:55:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:03,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 108 conjunts are in the unsatisfiable core [2023-12-15 21:55:03,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:03,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-15 21:55:04,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:55:04,147 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-15 21:55:04,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-15 21:55:04,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-15 21:55:04,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:55:04,310 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-15 21:55:04,311 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 53 [2023-12-15 21:55:04,316 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 36 treesize of output 15 [2023-12-15 21:55:04,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-15 21:55:04,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-15 21:55:04,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-15 21:55:04,533 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-15 21:55:04,533 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 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-15 21:55:04,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:55:04,549 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 38 treesize of output 27 [2023-12-15 21:55:04,565 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-15 21:55:04,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-15 21:55:04,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2023-12-15 21:55:04,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2023-12-15 21:55:05,001 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 19 treesize of output 11 [2023-12-15 21:55:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:55:05,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:55:09,366 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (v_ArrVal_643 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) v_ArrVal_643) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_644) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-12-15 21:55:09,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968722473] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:09,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:55:09,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 44 [2023-12-15 21:55:09,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806433486] [2023-12-15 21:55:09,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:55:09,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-15 21:55:09,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:09,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-15 21:55:09,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2268, Unknown=26, NotChecked=96, Total=2550 [2023-12-15 21:55:09,472 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-15 21:55:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:11,127 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2023-12-15 21:55:11,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-15 21:55:11,127 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2023-12-15 21:55:11,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:11,129 INFO L225 Difference]: With dead ends: 60 [2023-12-15 21:55:11,129 INFO L226 Difference]: Without dead ends: 58 [2023-12-15 21:55:11,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=418, Invalid=5108, Unknown=28, NotChecked=146, Total=5700 [2023-12-15 21:55:11,131 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 110 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:11,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 270 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:55:11,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-15 21:55:11,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 35. [2023-12-15 21:55:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:55:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-12-15 21:55:11,136 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 29 [2023-12-15 21:55:11,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:11,136 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-12-15 21:55:11,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-15 21:55:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-12-15 21:55:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-15 21:55:11,137 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:11,137 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:11,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 21:55:11,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:11,343 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:11,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:11,344 INFO L85 PathProgramCache]: Analyzing trace with hash 127932368, now seen corresponding path program 1 times [2023-12-15 21:55:11,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:11,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572107770] [2023-12-15 21:55:11,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:11,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:12,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:12,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:55:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:12,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:55:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:55:12,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:12,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572107770] [2023-12-15 21:55:12,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572107770] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:12,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026436771] [2023-12-15 21:55:12,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:12,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:12,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:12,383 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:55:12,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 21:55:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:12,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-15 21:55:12,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:12,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-15 21:55:12,718 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-15 21:55:12,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-15 21:55:12,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:55:12,830 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-15 21:55:12,831 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 54 treesize of output 41 [2023-12-15 21:55:12,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-15 21:55:12,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-15 21:55:13,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:55:13,038 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 38 treesize of output 27 [2023-12-15 21:55:13,050 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-15 21:55:13,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-15 21:55:13,234 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-12-15 21:55:13,234 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 51 [2023-12-15 21:55:13,253 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2023-12-15 21:55:13,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 66 [2023-12-15 21:55:13,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-15 21:55:13,348 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-15 21:55:13,348 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 15 treesize of output 7 [2023-12-15 21:55:13,391 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 35 treesize of output 19 [2023-12-15 21:55:13,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-15 21:55:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 21:55:13,395 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:55:13,613 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_817 (Array Int Int))) (or (not (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_821) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_817) .cse0) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|) 0)))) is different from false [2023-12-15 21:55:13,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026436771] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:13,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:55:13,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2023-12-15 21:55:13,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569392764] [2023-12-15 21:55:13,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:55:13,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-15 21:55:13,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:13,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-15 21:55:13,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1503, Unknown=22, NotChecked=78, Total=1722 [2023-12-15 21:55:13,616 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-15 21:55:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:14,934 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2023-12-15 21:55:14,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-15 21:55:14,935 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2023-12-15 21:55:14,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:14,935 INFO L225 Difference]: With dead ends: 80 [2023-12-15 21:55:14,935 INFO L226 Difference]: Without dead ends: 77 [2023-12-15 21:55:14,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=264, Invalid=3024, Unknown=22, NotChecked=112, Total=3422 [2023-12-15 21:55:14,937 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 59 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:14,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 381 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 21:55:14,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-15 21:55:14,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2023-12-15 21:55:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-15 21:55:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2023-12-15 21:55:14,946 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 31 [2023-12-15 21:55:14,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:14,946 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2023-12-15 21:55:14,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-15 21:55:14,946 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2023-12-15 21:55:14,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-15 21:55:14,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:14,947 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:14,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 21:55:15,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:15,152 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:15,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:15,152 INFO L85 PathProgramCache]: Analyzing trace with hash -315712365, now seen corresponding path program 2 times [2023-12-15 21:55:15,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:15,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3324537] [2023-12-15 21:55:15,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:15,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:16,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:16,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:55:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:16,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:55:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:55:16,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:16,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3324537] [2023-12-15 21:55:16,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3324537] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:16,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517947477] [2023-12-15 21:55:16,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 21:55:16,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:16,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:16,349 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:55:16,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-15 21:55:16,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 21:55:16,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:55:16,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 140 conjunts are in the unsatisfiable core [2023-12-15 21:55:16,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:16,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-15 21:55:16,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:55:16,984 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-15 21:55:16,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-15 21:55:17,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:55:17,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:55:17,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-15 21:55:17,177 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-15 21:55:17,192 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 105 treesize of output 68 [2023-12-15 21:55:17,198 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 36 treesize of output 15 [2023-12-15 21:55:17,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2023-12-15 21:55:17,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2023-12-15 21:55:17,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-15 21:55:17,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-12-15 21:55:17,285 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 11 treesize of output 3 [2023-12-15 21:55:17,430 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-15 21:55:17,431 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 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-15 21:55:17,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:55:17,441 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 53 treesize of output 36 [2023-12-15 21:55:17,462 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2023-12-15 21:55:17,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2023-12-15 21:55:17,494 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-15 21:55:17,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-15 21:55:18,035 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-15 21:55:18,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 26 [2023-12-15 21:55:18,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-12-15 21:55:18,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-12-15 21:55:18,131 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 20 treesize of output 15 [2023-12-15 21:55:18,183 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 19 treesize of output 11 [2023-12-15 21:55:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:55:18,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:55:18,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517947477] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:18,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:55:18,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25] total 39 [2023-12-15 21:55:18,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723040555] [2023-12-15 21:55:18,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:55:18,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-15 21:55:18,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:18,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-15 21:55:18,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2064, Unknown=38, NotChecked=0, Total=2256 [2023-12-15 21:55:18,940 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 39 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-15 21:55:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:20,274 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2023-12-15 21:55:20,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 21:55:20,274 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2023-12-15 21:55:20,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:20,275 INFO L225 Difference]: With dead ends: 75 [2023-12-15 21:55:20,275 INFO L226 Difference]: Without dead ends: 62 [2023-12-15 21:55:20,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=316, Invalid=3678, Unknown=38, NotChecked=0, Total=4032 [2023-12-15 21:55:20,276 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:20,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 205 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:55:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-15 21:55:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2023-12-15 21:55:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-15 21:55:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2023-12-15 21:55:20,288 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 31 [2023-12-15 21:55:20,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:20,288 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2023-12-15 21:55:20,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-15 21:55:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2023-12-15 21:55:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-15 21:55:20,291 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:20,291 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:20,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-15 21:55:20,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:20,498 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:20,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash -329022723, now seen corresponding path program 1 times [2023-12-15 21:55:20,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:20,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302167559] [2023-12-15 21:55:20,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:20,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:22,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:22,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:55:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:22,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:55:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:22,898 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:55:22,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:22,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302167559] [2023-12-15 21:55:22,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302167559] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:22,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659650347] [2023-12-15 21:55:22,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:22,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:22,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:22,899 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:55:22,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-15 21:55:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:23,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 151 conjunts are in the unsatisfiable core [2023-12-15 21:55:23,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:23,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-15 21:55:23,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:55:23,410 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-15 21:55:23,410 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-15 21:55:23,433 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-15 21:55:23,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-15 21:55:23,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-15 21:55:23,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:55:23,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:55:23,614 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-15 21:55:23,614 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 132 treesize of output 83 [2023-12-15 21:55:23,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:55:23,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2023-12-15 21:55:23,629 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 36 treesize of output 15 [2023-12-15 21:55:23,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2023-12-15 21:55:23,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-15 21:55:23,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-15 21:55:23,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-15 21:55:23,951 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-15 21:55:23,951 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 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-15 21:55:23,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:55:23,961 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 53 treesize of output 36 [2023-12-15 21:55:23,975 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-12-15 21:55:23,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2023-12-15 21:55:23,998 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-15 21:55:23,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-15 21:55:24,546 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2023-12-15 21:55:24,547 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 80 [2023-12-15 21:55:24,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2023-12-15 21:55:24,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2023-12-15 21:55:24,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-15 21:55:24,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-12-15 21:55:24,648 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 65 treesize of output 41 [2023-12-15 21:55:24,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-12-15 21:55:24,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-15 21:55:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:55:24,853 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:55:25,880 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1187 Int) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1194 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#2| .cse0 (store (select |c_#memory_int#2| .cse0) .cse1 v_ArrVal_1187)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1193) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1194) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1188) .cse2) .cse3)) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 (store (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1190) .cse2) .cse3) 4))))) is different from false [2023-12-15 21:55:25,895 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1187 Int) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1194 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| .cse4) .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#2| .cse0 (store (select |c_#memory_int#2| .cse0) .cse1 v_ArrVal_1187)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1193) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1194) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1188) .cse2) .cse3)) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 (store (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1190) .cse2) .cse3) 4)))))) is different from false [2023-12-15 21:55:25,904 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1187 Int) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1194 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| .cse4) .cse5)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#2| .cse0 (store (select |c_#memory_int#2| .cse0) .cse1 v_ArrVal_1187)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1193) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1194) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1188) .cse2) .cse3)) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 (store (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1190) .cse2) .cse3) 4)))))) is different from false [2023-12-15 21:55:26,012 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1204 (Array Int Int)) (v_ArrVal_1187 Int) (v_ArrVal_1203 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1194 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_1203)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_1204) .cse5) .cse6)) (.cse1 (select (select .cse4 .cse5) .cse6)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#2| .cse0 (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_1202) .cse0) .cse1 v_ArrVal_1187)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_1193) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1194) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_1188) .cse2) .cse3)) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 (store (select .cse4 .cse0) .cse1 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_1190) .cse2) .cse3) 4))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0)))) is different from false [2023-12-15 21:55:26,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659650347] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:26,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:55:26,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2023-12-15 21:55:26,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592546636] [2023-12-15 21:55:26,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:55:26,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-15 21:55:26,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:26,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-15 21:55:26,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2280, Unknown=40, NotChecked=396, Total=2862 [2023-12-15 21:55:26,016 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 46 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 36 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-15 21:55:27,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:27,866 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2023-12-15 21:55:27,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-15 21:55:27,867 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 36 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2023-12-15 21:55:27,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:27,867 INFO L225 Difference]: With dead ends: 66 [2023-12-15 21:55:27,867 INFO L226 Difference]: Without dead ends: 64 [2023-12-15 21:55:27,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=291, Invalid=4231, Unknown=50, NotChecked=540, Total=5112 [2023-12-15 21:55:27,869 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 52 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:27,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 255 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-15 21:55:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-15 21:55:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2023-12-15 21:55:27,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-15 21:55:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2023-12-15 21:55:27,876 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 32 [2023-12-15 21:55:27,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:27,877 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2023-12-15 21:55:27,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 36 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-15 21:55:27,877 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2023-12-15 21:55:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-15 21:55:27,877 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:27,877 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:27,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-15 21:55:28,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:28,082 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:28,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1638621109, now seen corresponding path program 1 times [2023-12-15 21:55:28,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:28,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003447155] [2023-12-15 21:55:28,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:28,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:29,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:29,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:55:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:29,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:55:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:55:29,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:29,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003447155] [2023-12-15 21:55:29,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003447155] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:29,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168742351] [2023-12-15 21:55:29,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:29,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:29,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:29,515 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:55:29,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-15 21:55:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:29,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 119 conjunts are in the unsatisfiable core [2023-12-15 21:55:29,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:29,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-15 21:55:30,022 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-15 21:55:30,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-15 21:55:30,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-15 21:55:30,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:55:30,160 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-15 21:55:30,161 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 53 [2023-12-15 21:55:30,165 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 24 treesize of output 1 [2023-12-15 21:55:30,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-15 21:55:30,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-15 21:55:30,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:55:30,391 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 38 treesize of output 27 [2023-12-15 21:55:30,406 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-15 21:55:30,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-15 21:55:30,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-15 21:55:31,004 INFO L349 Elim1Store]: treesize reduction 218, result has 4.8 percent of original size [2023-12-15 21:55:31,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 368 treesize of output 157 [2023-12-15 21:55:31,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 146 [2023-12-15 21:55:31,025 INFO L349 Elim1Store]: treesize reduction 96, result has 19.3 percent of original size [2023-12-15 21:55:31,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 205 treesize of output 161 [2023-12-15 21:55:31,120 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-15 21:55:31,120 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 15 treesize of output 7 [2023-12-15 21:55:31,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 74 [2023-12-15 21:55:31,314 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 106 treesize of output 66 [2023-12-15 21:55:31,320 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-12-15 21:55:31,320 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 63 treesize of output 25 [2023-12-15 21:55:31,323 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:55:31,323 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:55:31,986 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| Int) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1385)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1384)) (.cse3 (select (select .cse5 .cse6) .cse10))) (let ((.cse7 (select .cse5 .cse3)) (.cse8 (select (select .cse9 .cse6) .cse10))) (or (not (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse1 (let ((.cse4 (store .cse7 .cse8 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36|))) (store (store |c_#memory_$Pointer$#2.base| .cse3 .cse4) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| (store (select (store .cse5 .cse3 .cse4) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| .cse6))))) (select .cse1 (select (select .cse1 .cse0) .cse2))) (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 (store (select .cse9 .cse3) .cse8 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1374) .cse0) .cse2)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36|) 0)) (not (= .cse6 (select .cse7 .cse8)))))))) is different from false [2023-12-15 21:55:31,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168742351] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:31,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:55:31,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 48 [2023-12-15 21:55:31,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51240004] [2023-12-15 21:55:31,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:55:31,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-15 21:55:31,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:55:31,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-15 21:55:31,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2670, Unknown=13, NotChecked=104, Total=2970 [2023-12-15 21:55:31,991 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 48 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-15 21:55:34,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:55:34,348 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2023-12-15 21:55:34,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-15 21:55:34,349 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-12-15 21:55:34,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:55:34,349 INFO L225 Difference]: With dead ends: 72 [2023-12-15 21:55:34,349 INFO L226 Difference]: Without dead ends: 69 [2023-12-15 21:55:34,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=507, Invalid=6966, Unknown=13, NotChecked=170, Total=7656 [2023-12-15 21:55:34,351 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 70 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-15 21:55:34,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 350 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-15 21:55:34,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-15 21:55:34,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2023-12-15 21:55:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-15 21:55:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2023-12-15 21:55:34,362 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 34 [2023-12-15 21:55:34,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:55:34,362 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2023-12-15 21:55:34,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-15 21:55:34,362 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2023-12-15 21:55:34,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-15 21:55:34,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:55:34,364 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:34,371 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-15 21:55:34,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:34,569 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:55:34,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:55:34,570 INFO L85 PathProgramCache]: Analyzing trace with hash -742312008, now seen corresponding path program 2 times [2023-12-15 21:55:34,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:55:34,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223846433] [2023-12-15 21:55:34,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:55:34,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:55:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:35,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:55:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:35,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:55:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:35,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:55:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:55:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:55:35,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:55:35,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223846433] [2023-12-15 21:55:35,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223846433] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:55:35,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584865936] [2023-12-15 21:55:35,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 21:55:35,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:55:35,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:55:35,980 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:55:36,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-15 21:55:36,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 21:55:36,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:55:36,148 WARN L260 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 186 conjunts are in the unsatisfiable core [2023-12-15 21:55:36,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:55:36,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-15 21:55:36,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:55:36,455 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-15 21:55:36,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-15 21:55:36,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-15 21:55:36,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:55:36,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:55:36,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-15 21:55:36,649 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-15 21:55:36,649 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 154 treesize of output 76 [2023-12-15 21:55:36,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-15 21:55:36,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2023-12-15 21:55:36,762 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-15 21:55:36,762 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 42 [2023-12-15 21:55:36,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-12-15 21:55:36,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-15 21:55:36,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-15 21:55:36,905 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-15 21:55:37,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:55:37,024 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-12-15 21:55:37,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 67 [2023-12-15 21:55:37,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:55:37,043 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-12-15 21:55:37,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 45 [2023-12-15 21:55:37,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:55:37,065 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-12-15 21:55:37,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-12-15 21:55:37,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-15 21:55:37,955 INFO L349 Elim1Store]: treesize reduction 140, result has 15.7 percent of original size [2023-12-15 21:55:37,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 194 treesize of output 125 [2023-12-15 21:55:37,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:55:37,985 INFO L349 Elim1Store]: treesize reduction 69, result has 9.2 percent of original size [2023-12-15 21:55:37,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 65 [2023-12-15 21:55:37,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-12-15 21:55:38,000 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 20 treesize of output 1 [2023-12-15 21:55:38,173 INFO L349 Elim1Store]: treesize reduction 386, result has 32.4 percent of original size [2023-12-15 21:55:38,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 618 treesize of output 459 [2023-12-15 21:55:38,378 INFO L349 Elim1Store]: treesize reduction 330, result has 32.4 percent of original size [2023-12-15 21:55:38,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 485 treesize of output 440 [2023-12-15 21:55:38,435 INFO L349 Elim1Store]: treesize reduction 79, result has 31.3 percent of original size [2023-12-15 21:55:38,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 131 [2023-12-15 21:55:38,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2023-12-15 21:55:38,523 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:55:38,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 33 [2023-12-15 21:55:38,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 Received shutdown request... [2023-12-15 21:55:41,130 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:55:41,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-15 21:55:41,160 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:55:41,160 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:55:41,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-15 21:55:41,336 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 36 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-14-2-2-2-1 context. [2023-12-15 21:55:41,340 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-12-15 21:55:41,342 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:55:41,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:55:41 BoogieIcfgContainer [2023-12-15 21:55:41,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:55:41,346 INFO L158 Benchmark]: Toolchain (without parser) took 65003.24ms. Allocated memory was 173.0MB in the beginning and 483.4MB in the end (delta: 310.4MB). Free memory was 125.5MB in the beginning and 174.6MB in the end (delta: -49.1MB). Peak memory consumption was 273.1MB. Max. memory is 8.0GB. [2023-12-15 21:55:41,346 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 173.0MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:55:41,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.35ms. Allocated memory is still 173.0MB. Free memory was 125.2MB in the beginning and 107.0MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-15 21:55:41,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.68ms. Allocated memory is still 173.0MB. Free memory was 107.0MB in the beginning and 104.5MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:55:41,347 INFO L158 Benchmark]: Boogie Preprocessor took 41.43ms. Allocated memory is still 173.0MB. Free memory was 104.5MB in the beginning and 101.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:55:41,348 INFO L158 Benchmark]: RCFGBuilder took 394.58ms. Allocated memory is still 173.0MB. Free memory was 101.4MB in the beginning and 142.7MB in the end (delta: -41.3MB). Peak memory consumption was 22.5MB. Max. memory is 8.0GB. [2023-12-15 21:55:41,348 INFO L158 Benchmark]: TraceAbstraction took 64210.85ms. Allocated memory was 173.0MB in the beginning and 483.4MB in the end (delta: 310.4MB). Free memory was 142.2MB in the beginning and 174.6MB in the end (delta: -32.4MB). Peak memory consumption was 289.5MB. Max. memory is 8.0GB. [2023-12-15 21:55:41,352 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.39ms. Allocated memory is still 173.0MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 312.35ms. Allocated memory is still 173.0MB. Free memory was 125.2MB in the beginning and 107.0MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.68ms. Allocated memory is still 173.0MB. Free memory was 107.0MB in the beginning and 104.5MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.43ms. Allocated memory is still 173.0MB. Free memory was 104.5MB in the beginning and 101.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 394.58ms. Allocated memory is still 173.0MB. Free memory was 101.4MB in the beginning and 142.7MB in the end (delta: -41.3MB). Peak memory consumption was 22.5MB. Max. memory is 8.0GB. * TraceAbstraction took 64210.85ms. Allocated memory was 173.0MB in the beginning and 483.4MB in the end (delta: 310.4MB). Free memory was 142.2MB in the beginning and 174.6MB in the end (delta: -32.4MB). Peak memory consumption was 289.5MB. Max. memory is 8.0GB. * 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 - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 639). Cancelled while NwaCegarLoop was analyzing trace of length 36 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-14-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.2s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 29.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 418 SdHoareTripleChecker+Valid, 23.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 413 mSDsluCounter, 2023 SdHoareTripleChecker+Invalid, 23.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1871 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4754 IncrementalHoareTripleChecker+Invalid, 4856 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 152 mSDtfsCounter, 4754 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 605 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 430 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 5002 ImplicationChecksByTransitivity, 19.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=6, InterpolantAutomatonStates: 181, 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, 9 MinimizatonAttempts, 73 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 23.9s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 459 ConstructedInterpolants, 75 QuantifiedInterpolants, 11133 SizeOfPredicates, 159 NumberOfNonLiveVariables, 2390 ConjunctsInSsa, 718 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 92/194 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown