./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c4f91361 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_circular_traversal-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-c4f9136-m [2023-11-23 15:52:35,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 15:52:35,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-23 15:52:35,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 15:52:35,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 15:52:35,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 15:52:35,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 15:52:35,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 15:52:35,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 15:52:35,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 15:52:35,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 15:52:35,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 15:52:35,983 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 15:52:35,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 15:52:35,985 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 15:52:35,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 15:52:35,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 15:52:35,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 15:52:35,988 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 15:52:35,989 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 15:52:35,989 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 15:52:35,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 15:52:35,989 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 15:52:35,990 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 15:52:35,990 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 15:52:35,990 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 15:52:35,990 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 15:52:35,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 15:52:35,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 15:52:35,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 15:52:35,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 15:52:35,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 15:52:35,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 15:52:35,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 15:52:35,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 15:52:35,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 15:52:35,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 15:52:35,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 15:52:35,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 15:52:35,994 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2023-11-23 15:52:36,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 15:52:36,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 15:52:36,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 15:52:36,207 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 15:52:36,208 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 15:52:36,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_circular_traversal-1.i [2023-11-23 15:52:37,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 15:52:37,646 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 15:52:37,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_circular_traversal-1.i [2023-11-23 15:52:37,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b582c77f1/46490e210bf5442384bfe33248b9ce16/FLAG360bad283 [2023-11-23 15:52:37,673 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b582c77f1/46490e210bf5442384bfe33248b9ce16 [2023-11-23 15:52:37,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 15:52:37,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 15:52:37,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 15:52:37,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 15:52:37,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 15:52:37,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:52:37" (1/1) ... [2023-11-23 15:52:37,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe5d23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:37, skipping insertion in model container [2023-11-23 15:52:37,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:52:37" (1/1) ... [2023-11-23 15:52:37,724 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 15:52:37,921 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 15:52:37,933 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 15:52:37,969 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 15:52:37,987 INFO L206 MainTranslator]: Completed translation [2023-11-23 15:52:37,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:37 WrapperNode [2023-11-23 15:52:37,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 15:52:37,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 15:52:37,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 15:52:37,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 15:52:37,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:37" (1/1) ... [2023-11-23 15:52:38,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:37" (1/1) ... [2023-11-23 15:52:38,032 INFO L138 Inliner]: procedures = 122, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2023-11-23 15:52:38,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 15:52:38,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 15:52:38,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 15:52:38,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 15:52:38,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:37" (1/1) ... [2023-11-23 15:52:38,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:37" (1/1) ... [2023-11-23 15:52:38,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:37" (1/1) ... [2023-11-23 15:52:38,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:37" (1/1) ... [2023-11-23 15:52:38,053 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:37" (1/1) ... [2023-11-23 15:52:38,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:37" (1/1) ... [2023-11-23 15:52:38,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:37" (1/1) ... [2023-11-23 15:52:38,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:37" (1/1) ... [2023-11-23 15:52:38,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 15:52:38,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 15:52:38,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 15:52:38,089 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 15:52:38,090 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:37" (1/1) ... [2023-11-23 15:52:38,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 15:52:38,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:52:38,129 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 15:52:38,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 15:52:38,194 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-23 15:52:38,195 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-23 15:52:38,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 15:52:38,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 15:52:38,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 15:52:38,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 15:52:38,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 15:52:38,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 15:52:38,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 15:52:38,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 15:52:38,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 15:52:38,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 15:52:38,309 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 15:52:38,311 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 15:52:38,346 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-23 15:52:38,526 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 15:52:38,561 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 15:52:38,561 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-23 15:52:38,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:52:38 BoogieIcfgContainer [2023-11-23 15:52:38,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 15:52:38,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 15:52:38,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 15:52:38,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 15:52:38,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:52:37" (1/3) ... [2023-11-23 15:52:38,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33db53c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:52:38, skipping insertion in model container [2023-11-23 15:52:38,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:37" (2/3) ... [2023-11-23 15:52:38,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33db53c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:52:38, skipping insertion in model container [2023-11-23 15:52:38,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:52:38" (3/3) ... [2023-11-23 15:52:38,574 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2023-11-23 15:52:38,587 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 15:52:38,587 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2023-11-23 15:52:38,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 15:52:38,636 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@119ade41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 15:52:38,636 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2023-11-23 15:52:38,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 34 states have (on average 2.176470588235294) internal successors, (74), 63 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:38,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-23 15:52:38,647 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:52:38,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-23 15:52:38,648 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-23 15:52:38,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:52:38,653 INFO L85 PathProgramCache]: Analyzing trace with hash 173399, now seen corresponding path program 1 times [2023-11-23 15:52:38,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:52:38,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998018817] [2023-11-23 15:52:38,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:38,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:52:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:52:38,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:52:38,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998018817] [2023-11-23 15:52:38,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998018817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:52:38,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:52:38,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 15:52:38,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555171059] [2023-11-23 15:52:38,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:52:38,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 15:52:38,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:52:38,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 15:52:38,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:52:38,887 INFO L87 Difference]: Start difference. First operand has 65 states, 34 states have (on average 2.176470588235294) internal successors, (74), 63 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:38,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:52:38,972 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2023-11-23 15:52:38,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 15:52:38,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-23 15:52:38,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:52:38,978 INFO L225 Difference]: With dead ends: 61 [2023-11-23 15:52:38,978 INFO L226 Difference]: Without dead ends: 56 [2023-11-23 15:52:38,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11-23 15:52:38,982 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 15 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:52:38,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 80 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:52:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-23 15:52:39,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-11-23 15:52:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.935483870967742) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2023-11-23 15:52:39,026 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 3 [2023-11-23 15:52:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:52:39,026 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2023-11-23 15:52:39,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2023-11-23 15:52:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-23 15:52:39,028 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:52:39,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-23 15:52:39,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 15:52:39,029 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-23 15:52:39,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:52:39,030 INFO L85 PathProgramCache]: Analyzing trace with hash 173400, now seen corresponding path program 1 times [2023-11-23 15:52:39,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:52:39,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245016778] [2023-11-23 15:52:39,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:39,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:52:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:52:39,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:52:39,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245016778] [2023-11-23 15:52:39,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245016778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:52:39,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:52:39,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 15:52:39,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180924644] [2023-11-23 15:52:39,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:52:39,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 15:52:39,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:52:39,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 15:52:39,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:52:39,194 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:39,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:52:39,230 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2023-11-23 15:52:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 15:52:39,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-23 15:52:39,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:52:39,231 INFO L225 Difference]: With dead ends: 53 [2023-11-23 15:52:39,231 INFO L226 Difference]: Without dead ends: 53 [2023-11-23 15:52:39,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11-23 15:52:39,233 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:52:39,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 78 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:52:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-23 15:52:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-23 15:52:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2023-11-23 15:52:39,238 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 3 [2023-11-23 15:52:39,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:52:39,238 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2023-11-23 15:52:39,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2023-11-23 15:52:39,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-23 15:52:39,239 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:52:39,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:52:39,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 15:52:39,240 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-23 15:52:39,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:52:39,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1227434401, now seen corresponding path program 1 times [2023-11-23 15:52:39,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:52:39,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371173597] [2023-11-23 15:52:39,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:39,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:52:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:52:39,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:52:39,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371173597] [2023-11-23 15:52:39,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371173597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:52:39,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:52:39,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 15:52:39,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640012010] [2023-11-23 15:52:39,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:52:39,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 15:52:39,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:52:39,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 15:52:39,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:52:39,316 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:39,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:52:39,332 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2023-11-23 15:52:39,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 15:52:39,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-23 15:52:39,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:52:39,333 INFO L225 Difference]: With dead ends: 61 [2023-11-23 15:52:39,333 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 15:52:39,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:52:39,334 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:52:39,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 97 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:52:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 15:52:39,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2023-11-23 15:52:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.8125) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-11-23 15:52:39,339 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 7 [2023-11-23 15:52:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:52:39,339 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-11-23 15:52:39,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-11-23 15:52:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-23 15:52:39,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:52:39,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:52:39,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 15:52:39,340 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-23 15:52:39,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:52:39,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1227432832, now seen corresponding path program 1 times [2023-11-23 15:52:39,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:52:39,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561027130] [2023-11-23 15:52:39,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:39,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:52:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:52:39,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:52:39,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561027130] [2023-11-23 15:52:39,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561027130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:52:39,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:52:39,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 15:52:39,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120295343] [2023-11-23 15:52:39,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:52:39,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 15:52:39,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:52:39,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 15:52:39,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:52:39,379 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:39,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:52:39,410 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2023-11-23 15:52:39,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 15:52:39,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-23 15:52:39,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:52:39,411 INFO L225 Difference]: With dead ends: 52 [2023-11-23 15:52:39,411 INFO L226 Difference]: Without dead ends: 52 [2023-11-23 15:52:39,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:52:39,413 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:52:39,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:52:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-23 15:52:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-23 15:52:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.75) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:39,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2023-11-23 15:52:39,416 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 7 [2023-11-23 15:52:39,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:52:39,417 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2023-11-23 15:52:39,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2023-11-23 15:52:39,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-23 15:52:39,417 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:52:39,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:52:39,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 15:52:39,418 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-23 15:52:39,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:52:39,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1227432833, now seen corresponding path program 1 times [2023-11-23 15:52:39,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:52:39,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713010709] [2023-11-23 15:52:39,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:39,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:52:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:52:39,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:52:39,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713010709] [2023-11-23 15:52:39,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713010709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:52:39,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:52:39,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 15:52:39,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287592707] [2023-11-23 15:52:39,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:52:39,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 15:52:39,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:52:39,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 15:52:39,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:52:39,468 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:52:39,501 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2023-11-23 15:52:39,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 15:52:39,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-23 15:52:39,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:52:39,504 INFO L225 Difference]: With dead ends: 50 [2023-11-23 15:52:39,504 INFO L226 Difference]: Without dead ends: 50 [2023-11-23 15:52:39,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:52:39,505 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:52:39,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:52:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-23 15:52:39,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-23 15:52:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.6875) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:39,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-11-23 15:52:39,515 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 7 [2023-11-23 15:52:39,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:52:39,515 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-11-23 15:52:39,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:39,515 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-11-23 15:52:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-23 15:52:39,518 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:52:39,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:52:39,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 15:52:39,518 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-23 15:52:39,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:52:39,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2128480533, now seen corresponding path program 1 times [2023-11-23 15:52:39,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:52:39,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028772952] [2023-11-23 15:52:39,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:39,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:52:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:52:39,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:52:39,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028772952] [2023-11-23 15:52:39,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028772952] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:52:39,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803909606] [2023-11-23 15:52:39,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:39,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:52:39,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:52:39,640 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-11-23 15:52:39,647 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-11-23 15:52:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:39,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 15:52:39,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:52:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:52:39,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:52:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:52:39,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803909606] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:52:39,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:52:39,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-23 15:52:39,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79746382] [2023-11-23 15:52:39,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:52:39,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 15:52:39,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:52:39,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 15:52:39,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-23 15:52:39,873 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:52:39,920 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2023-11-23 15:52:39,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 15:52:39,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-23 15:52:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:52:39,921 INFO L225 Difference]: With dead ends: 62 [2023-11-23 15:52:39,921 INFO L226 Difference]: Without dead ends: 62 [2023-11-23 15:52:39,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-23 15:52:39,927 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:52:39,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 175 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:52:39,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-23 15:52:39,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-23 15:52:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.5) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2023-11-23 15:52:39,940 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 11 [2023-11-23 15:52:39,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:52:39,940 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2023-11-23 15:52:39,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2023-11-23 15:52:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 15:52:39,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:52:39,941 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:52:39,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 15:52:40,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-23 15:52:40,154 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-23 15:52:40,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:52:40,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1800396599, now seen corresponding path program 2 times [2023-11-23 15:52:40,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:52:40,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016489082] [2023-11-23 15:52:40,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:40,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:52:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-23 15:52:40,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:52:40,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016489082] [2023-11-23 15:52:40,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016489082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:52:40,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:52:40,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 15:52:40,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691599502] [2023-11-23 15:52:40,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:52:40,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 15:52:40,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:52:40,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 15:52:40,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:52:40,339 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:52:40,420 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2023-11-23 15:52:40,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 15:52:40,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-23 15:52:40,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:52:40,421 INFO L225 Difference]: With dead ends: 61 [2023-11-23 15:52:40,421 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 15:52:40,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 15:52:40,422 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:52:40,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 79 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:52:40,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 15:52:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2023-11-23 15:52:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2023-11-23 15:52:40,425 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 23 [2023-11-23 15:52:40,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:52:40,425 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2023-11-23 15:52:40,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:40,426 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2023-11-23 15:52:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 15:52:40,426 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:52:40,426 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:52:40,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 15:52:40,427 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-23 15:52:40,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:52:40,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1800396598, now seen corresponding path program 1 times [2023-11-23 15:52:40,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:52:40,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808065963] [2023-11-23 15:52:40,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:40,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:52:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 15:52:40,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:52:40,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808065963] [2023-11-23 15:52:40,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808065963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:52:40,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:52:40,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 15:52:40,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869578946] [2023-11-23 15:52:40,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:52:40,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 15:52:40,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:52:40,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 15:52:40,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:52:40,601 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:52:40,681 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2023-11-23 15:52:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 15:52:40,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-23 15:52:40,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:52:40,683 INFO L225 Difference]: With dead ends: 66 [2023-11-23 15:52:40,683 INFO L226 Difference]: Without dead ends: 66 [2023-11-23 15:52:40,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 15:52:40,683 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:52:40,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 117 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:52:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-23 15:52:40,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2023-11-23 15:52:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2023-11-23 15:52:40,686 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 23 [2023-11-23 15:52:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:52:40,687 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2023-11-23 15:52:40,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2023-11-23 15:52:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-23 15:52:40,688 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:52:40,688 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:52:40,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 15:52:40,688 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-23 15:52:40,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:52:40,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1967090391, now seen corresponding path program 1 times [2023-11-23 15:52:40,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:52:40,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602625970] [2023-11-23 15:52:40,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:40,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:52:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 15:52:41,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:52:41,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602625970] [2023-11-23 15:52:41,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602625970] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:52:41,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80976997] [2023-11-23 15:52:41,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:41,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:52:41,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:52:41,189 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-11-23 15:52:41,217 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-11-23 15:52:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:41,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-23 15:52:41,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:52:41,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 15:52:41,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:52:41,495 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 25 treesize of output 13 [2023-11-23 15:52:41,525 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 15:52:41,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:52:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 15:52:41,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80976997] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:52:41,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:52:41,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2023-11-23 15:52:41,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587101507] [2023-11-23 15:52:41,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:52:41,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-23 15:52:41,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:52:41,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-23 15:52:41,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-11-23 15:52:41,692 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:41,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:52:41,921 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2023-11-23 15:52:41,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 15:52:41,922 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-23 15:52:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:52:41,922 INFO L225 Difference]: With dead ends: 62 [2023-11-23 15:52:41,922 INFO L226 Difference]: Without dead ends: 62 [2023-11-23 15:52:41,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2023-11-23 15:52:41,923 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:52:41,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 344 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:52:41,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-23 15:52:41,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-23 15:52:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.375) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2023-11-23 15:52:41,926 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 27 [2023-11-23 15:52:41,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:52:41,926 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2023-11-23 15:52:41,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2023-11-23 15:52:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-23 15:52:41,927 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:52:41,927 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:52:41,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-23 15:52:42,140 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,SelfDestructingSolverStorable8 [2023-11-23 15:52:42,141 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-23 15:52:42,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:52:42,142 INFO L85 PathProgramCache]: Analyzing trace with hash -850217418, now seen corresponding path program 1 times [2023-11-23 15:52:42,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:52:42,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993746398] [2023-11-23 15:52:42,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:42,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:52:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 15:52:42,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:52:42,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993746398] [2023-11-23 15:52:42,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993746398] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:52:42,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532661715] [2023-11-23 15:52:42,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:42,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:52:42,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:52:42,899 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-11-23 15:52:42,900 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-11-23 15:52:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:43,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-23 15:52:43,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:52:43,042 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-11-23 15:52:43,080 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 15:52:43,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2023-11-23 15:52:43,136 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-11-23 15:52:43,140 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 15 treesize of output 1 [2023-11-23 15:52:43,171 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 33 treesize of output 17 [2023-11-23 15:52:43,178 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 23 treesize of output 11 [2023-11-23 15:52:43,231 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-23 15:52:43,231 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 29 treesize of output 28 [2023-11-23 15:52:43,242 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 15:52:43,242 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 19 treesize of output 18 [2023-11-23 15:52:43,390 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 15:52:43,390 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 1 case distinctions, treesize of input 48 treesize of output 35 [2023-11-23 15:52:43,399 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 15:52:43,400 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 1 case distinctions, treesize of input 55 treesize of output 46 [2023-11-23 15:52:43,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:43,437 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 40 treesize of output 32 [2023-11-23 15:52:43,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:43,444 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 28 treesize of output 28 [2023-11-23 15:52:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 15:52:43,479 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:52:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 15:52:43,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532661715] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:52:43,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:52:43,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-11-23 15:52:43,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472347298] [2023-11-23 15:52:43,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:52:43,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-23 15:52:43,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:52:43,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-23 15:52:43,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2023-11-23 15:52:43,932 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:52:44,525 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2023-11-23 15:52:44,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 15:52:44,526 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-23 15:52:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:52:44,526 INFO L225 Difference]: With dead ends: 100 [2023-11-23 15:52:44,526 INFO L226 Difference]: Without dead ends: 100 [2023-11-23 15:52:44,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2023-11-23 15:52:44,527 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 191 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 15:52:44,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 141 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 15:52:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-23 15:52:44,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 70. [2023-11-23 15:52:44,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2023-11-23 15:52:44,531 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 28 [2023-11-23 15:52:44,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:52:44,531 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2023-11-23 15:52:44,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2023-11-23 15:52:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-23 15:52:44,532 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:52:44,532 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:52:44,549 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-11-23 15:52:44,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:52:44,745 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-23 15:52:44,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:52:44,745 INFO L85 PathProgramCache]: Analyzing trace with hash -850217417, now seen corresponding path program 1 times [2023-11-23 15:52:44,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:52:44,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251829316] [2023-11-23 15:52:44,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:44,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:52:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 15:52:45,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:52:45,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251829316] [2023-11-23 15:52:45,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251829316] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:52:45,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895244955] [2023-11-23 15:52:45,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:45,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:52:45,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:52:45,349 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-11-23 15:52:45,381 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-11-23 15:52:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:45,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-23 15:52:45,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:52:45,492 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 8 treesize of output 1 [2023-11-23 15:52:45,538 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 15:52:45,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2023-11-23 15:52:45,582 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-11-23 15:52:45,587 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 15 treesize of output 1 [2023-11-23 15:52:45,615 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 33 treesize of output 17 [2023-11-23 15:52:45,620 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 23 treesize of output 11 [2023-11-23 15:52:45,680 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-23 15:52:45,680 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 29 treesize of output 28 [2023-11-23 15:52:45,690 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 15:52:45,690 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 19 treesize of output 18 [2023-11-23 15:52:45,813 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 15:52:45,813 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 1 case distinctions, treesize of input 48 treesize of output 35 [2023-11-23 15:52:45,820 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 15:52:45,820 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 1 case distinctions, treesize of input 55 treesize of output 46 [2023-11-23 15:52:45,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:45,857 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 40 treesize of output 32 [2023-11-23 15:52:45,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:45,867 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 28 treesize of output 28 [2023-11-23 15:52:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 15:52:45,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:52:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 15:52:46,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895244955] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:52:46,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:52:46,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2023-11-23 15:52:46,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796259355] [2023-11-23 15:52:46,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:52:46,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-23 15:52:46,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:52:46,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-23 15:52:46,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2023-11-23 15:52:46,792 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:52:48,107 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2023-11-23 15:52:48,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-23 15:52:48,107 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-23 15:52:48,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:52:48,108 INFO L225 Difference]: With dead ends: 84 [2023-11-23 15:52:48,108 INFO L226 Difference]: Without dead ends: 84 [2023-11-23 15:52:48,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2023-11-23 15:52:48,108 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 125 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 15:52:48,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 226 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 15:52:48,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-23 15:52:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2023-11-23 15:52:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 71 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2023-11-23 15:52:48,111 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 28 [2023-11-23 15:52:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:52:48,111 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2023-11-23 15:52:48,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:48,111 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2023-11-23 15:52:48,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-23 15:52:48,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:52:48,112 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:52:48,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-23 15:52:48,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:52:48,328 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-23 15:52:48,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:52:48,329 INFO L85 PathProgramCache]: Analyzing trace with hash -602887146, now seen corresponding path program 1 times [2023-11-23 15:52:48,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:52:48,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408803966] [2023-11-23 15:52:48,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:48,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:52:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 15:52:49,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:52:49,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408803966] [2023-11-23 15:52:49,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408803966] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:52:49,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180554897] [2023-11-23 15:52:49,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:49,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:52:49,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:52:49,377 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-11-23 15:52:49,383 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-11-23 15:52:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:49,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-23 15:52:49,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:52:49,522 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-11-23 15:52:49,574 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 15:52:49,575 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 19 treesize of output 16 [2023-11-23 15:52:49,605 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 15:52:49,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-11-23 15:52:49,663 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 15:52:49,663 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-11-23 15:52:49,731 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-11-23 15:52:49,789 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-23 15:52:49,789 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 16 treesize of output 18 [2023-11-23 15:52:49,848 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 20 treesize of output 15 [2023-11-23 15:52:49,856 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-11-23 15:52:49,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-11-23 15:52:49,910 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-11-23 15:52:49,935 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 20 treesize of output 15 [2023-11-23 15:52:49,940 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 43 treesize of output 23 [2023-11-23 15:52:50,005 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-11-23 15:52:50,012 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 20 treesize of output 15 [2023-11-23 15:52:50,019 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 19 treesize of output 18 [2023-11-23 15:52:50,140 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 20 treesize of output 15 [2023-11-23 15:52:50,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:52:50,161 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 30 treesize of output 21 [2023-11-23 15:52:50,167 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 15:52:50,168 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 1 case distinctions, treesize of input 50 treesize of output 33 [2023-11-23 15:52:50,210 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:52:50,211 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 42 treesize of output 26 [2023-11-23 15:52:50,217 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 15 treesize of output 7 [2023-11-23 15:52:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 15:52:50,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:52:51,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 39 [2023-11-23 15:52:51,529 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,534 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 1 case distinctions, treesize of input 57 treesize of output 49 [2023-11-23 15:52:51,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2023-11-23 15:52:51,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 39 [2023-11-23 15:52:51,567 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,570 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 1 case distinctions, treesize of input 253 treesize of output 227 [2023-11-23 15:52:51,576 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,576 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 49 treesize of output 43 [2023-11-23 15:52:51,580 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,581 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 34 treesize of output 24 [2023-11-23 15:52:51,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-23 15:52:51,614 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,615 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 36 treesize of output 24 [2023-11-23 15:52:51,620 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 5 treesize of output 3 [2023-11-23 15:52:51,624 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 7 treesize of output 3 [2023-11-23 15:52:51,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 39 [2023-11-23 15:52:51,633 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,634 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,634 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 57 treesize of output 41 [2023-11-23 15:52:51,637 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,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 21 treesize of output 15 [2023-11-23 15:52:51,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-23 15:52:51,648 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,649 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 36 treesize of output 24 [2023-11-23 15:52:51,655 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 7 treesize of output 3 [2023-11-23 15:52:51,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 39 [2023-11-23 15:52:51,665 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,665 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 253 treesize of output 227 [2023-11-23 15:52:51,672 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,672 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 49 treesize of output 43 [2023-11-23 15:52:51,676 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,677 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 53 treesize of output 41 [2023-11-23 15:52:51,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 39 [2023-11-23 15:52:51,711 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,712 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,712 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 57 treesize of output 41 [2023-11-23 15:52:51,715 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,715 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 21 treesize of output 15 [2023-11-23 15:52:51,723 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 5 treesize of output 3 [2023-11-23 15:52:51,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-23 15:52:51,730 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-11-23 15:52:51,736 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 5 treesize of output 3 [2023-11-23 15:52:51,739 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 7 treesize of output 3 [2023-11-23 15:52:51,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-23 15:52:51,749 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,750 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 36 treesize of output 24 [2023-11-23 15:52:51,758 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 7 treesize of output 3 [2023-11-23 15:52:51,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-23 15:52:51,773 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,775 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 36 treesize of output 24 [2023-11-23 15:52:51,777 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 5 treesize of output 3 [2023-11-23 15:52:51,781 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 7 treesize of output 3 [2023-11-23 15:52:51,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-23 15:52:51,794 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,795 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 36 treesize of output 24 [2023-11-23 15:52:51,799 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 7 treesize of output 3 [2023-11-23 15:52:51,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 39 [2023-11-23 15:52:51,817 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,822 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 1 case distinctions, treesize of input 57 treesize of output 49 [2023-11-23 15:52:51,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2023-11-23 15:52:51,838 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 5 treesize of output 3 [2023-11-23 15:52:51,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 39 [2023-11-23 15:52:51,852 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,858 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 1 case distinctions, treesize of input 57 treesize of output 49 [2023-11-23 15:52:51,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2023-11-23 15:52:51,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-23 15:52:51,881 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,883 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 36 treesize of output 24 [2023-11-23 15:52:51,896 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 7 treesize of output 3 [2023-11-23 15:52:51,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-23 15:52:51,910 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,912 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 36 treesize of output 24 [2023-11-23 15:52:51,920 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 5 treesize of output 3 [2023-11-23 15:52:51,924 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 7 treesize of output 3 [2023-11-23 15:52:51,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 39 [2023-11-23 15:52:51,930 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:51,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,936 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 1 case distinctions, treesize of input 57 treesize of output 49 [2023-11-23 15:52:51,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:52:51,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2023-11-23 15:52:51,973 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 5 treesize of output 3 [2023-11-23 15:52:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 15:52:52,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180554897] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:52:52,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:52:52,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 32 [2023-11-23 15:52:52,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183009346] [2023-11-23 15:52:52,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:52:52,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-23 15:52:52,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:52:52,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-23 15:52:52,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=952, Unknown=4, NotChecked=0, Total=1056 [2023-11-23 15:52:52,783 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:54,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:52:54,197 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2023-11-23 15:52:54,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 15:52:54,198 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-23 15:52:54,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:52:54,198 INFO L225 Difference]: With dead ends: 84 [2023-11-23 15:52:54,198 INFO L226 Difference]: Without dead ends: 84 [2023-11-23 15:52:54,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=275, Invalid=1700, Unknown=5, NotChecked=0, Total=1980 [2023-11-23 15:52:54,199 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 15:52:54,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 341 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 877 Invalid, 2 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 15:52:54,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-23 15:52:54,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 66. [2023-11-23 15:52:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.320754716981132) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2023-11-23 15:52:54,202 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 32 [2023-11-23 15:52:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:52:54,202 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2023-11-23 15:52:54,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:52:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2023-11-23 15:52:54,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 15:52:54,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:52:54,203 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:52:54,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-23 15:52:54,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-23 15:52:54,415 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-23 15:52:54,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:52:54,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1509589783, now seen corresponding path program 2 times [2023-11-23 15:52:54,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:52:54,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594302414] [2023-11-23 15:52:54,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:52:54,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:52:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:52:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:52:55,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:52:55,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594302414] [2023-11-23 15:52:55,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594302414] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:52:55,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287855822] [2023-11-23 15:52:55,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 15:52:55,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:52:55,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:52:55,623 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-11-23 15:52:55,660 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-11-23 15:52:55,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 15:52:55,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 15:52:55,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 90 conjunts are in the unsatisfiable core [2023-11-23 15:52:55,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:52:55,810 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-11-23 15:52:55,828 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 15:52:55,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-11-23 15:52:55,852 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 15:52:55,852 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-11-23 15:52:55,957 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-23 15:52:55,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-23 15:52:56,033 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-11-23 15:52:56,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-11-23 15:52:56,113 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-11-23 15:52:56,121 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 41 treesize of output 21 [2023-11-23 15:52:56,207 INFO L349 Elim1Store]: treesize reduction 44, result has 45.0 percent of original size [2023-11-23 15:52:56,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 45 [2023-11-23 15:52:56,303 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-11-23 15:52:56,303 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 69 treesize of output 41 [2023-11-23 15:52:56,328 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-23 15:52:56,329 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 23 treesize of output 22 [2023-11-23 15:52:56,425 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 15:52:56,425 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 1 case distinctions, treesize of input 132 treesize of output 74 [2023-11-23 15:52:56,446 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-23 15:52:56,446 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-11-23 15:52:56,625 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-23 15:52:56,625 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 85 [2023-11-23 15:52:56,639 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-23 15:52:56,640 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 26 treesize of output 28 [2023-11-23 15:52:57,089 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2023-11-23 15:52:57,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 225 treesize of output 160 [2023-11-23 15:52:57,100 INFO L349 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2023-11-23 15:52:57,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 232 treesize of output 232 [2023-11-23 15:52:57,606 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-23 15:52:57,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 64 [2023-11-23 15:52:57,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:52:57,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:52:57,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2023-11-23 15:52:57,697 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-23 15:52:57,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 51 [2023-11-23 15:52:57,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-23 15:52:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:52:57,831 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:52:58,315 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse4 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse4)) (.cse7 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (or .cse0 (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 Int)) (let ((.cse5 (select v_ArrVal_1170 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select |c_#valid| (select (select (store .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_ArrVal_1169)) .cse4) .cse5)) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1170) .cse4) .cse5)) (not (= (store .cse7 .cse3 (select v_ArrVal_1170 .cse3)) v_ArrVal_1170)))))) (let ((.cse9 (select .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_1169 Int)) (let ((.cse8 (select (select (store .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_ArrVal_1169)) .cse4) .cse9))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse8) (= (select |c_#valid| .cse8) 1)))) (and .cse0 (= .cse9 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 Int)) (let ((.cse10 (select v_ArrVal_1170 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select |c_#valid| (select (select (store .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_ArrVal_1169)) .cse4) .cse10)) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse10) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1170) .cse4) .cse10)) (not (= (store .cse7 .cse3 (select v_ArrVal_1170 .cse3)) v_ArrVal_1170)))))))))) is different from false [2023-11-23 15:52:59,012 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse6 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse4 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1163 Int) (v_ArrVal_1164 Int) (v_ArrVal_1169 Int)) (let ((.cse1 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 .cse4 v_ArrVal_1164)))) (store .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse0 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 .cse4 v_ArrVal_1163)))) (let ((.cse2 (store (select .cse5 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse3 (select (store .cse5 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse2) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse2) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1169)) (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) .cse1))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0) (= (select |c_#valid| .cse0) 1) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (forall ((v_ArrVal_1163 Int) (v_ArrVal_1164 Int)) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 .cse4 v_ArrVal_1163)))) (let ((.cse10 (store (select .cse15 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse11 (select (store .cse15 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse10) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse9) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 .cse4 v_ArrVal_1164)))) (let ((.cse12 (select v_ArrVal_1170 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse13 (store (select .cse14 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse10) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse11 .cse4 v_ArrVal_1169)) .cse9) .cse12)) 1) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse13) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1170) .cse9) .cse12) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (not (= (store (select (store .cse14 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse13) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 (select v_ArrVal_1170 .cse4)) v_ArrVal_1170)))))))))))) (forall ((v_ArrVal_1163 Int) (v_ArrVal_1164 Int) (v_ArrVal_1169 Int)) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 .cse4 v_ArrVal_1163)))) (let ((.cse18 (store (select .cse21 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse19 (select (store .cse21 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse18) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse17 (select .cse19 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse18) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse19 .cse4 v_ArrVal_1169)) .cse17) (select (select (let ((.cse20 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 .cse4 v_ArrVal_1164)))) (store .cse20 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse20 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse16) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse17) (= (select |c_#valid| .cse16) 1)))))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1163 Int) (v_ArrVal_1164 Int) (v_ArrVal_1169 Int)) (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 .cse4 v_ArrVal_1163)))) (let ((.cse22 (store (select .cse28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 .cse4 v_ArrVal_1164))) (.cse23 (select (store .cse28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse22) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse25 (select v_ArrVal_1170 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse26 (store (select .cse27 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse22) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse23 .cse4 v_ArrVal_1169)) .cse24) .cse25)) 1) (= .cse25 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1170) .cse24) .cse25) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (not (= (store (select (store .cse27 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse26) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 (select v_ArrVal_1170 .cse4)) v_ArrVal_1170)))))))))) is different from false [2023-11-23 15:52:59,196 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1163 Int) (v_ArrVal_1164 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int) (v_ArrVal_1159 Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_1163)))) (let ((.cse3 (store (select .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse4 (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse3) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse0 (select .cse4 0))) (or (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| .cse0) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_1164)))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse5 (select v_ArrVal_1170 0))) (or (not (= (store (select (store .cse1 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse2) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 4 (select v_ArrVal_1170 4)) v_ArrVal_1170)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1159) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse3) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse4 4 v_ArrVal_1169)) .cse0) .cse5)) 1) (= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse2) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1170) .cse0) .cse5)))))))))))) (forall ((v_ArrVal_1163 Int) (v_ArrVal_1164 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int) (v_ArrVal_1169 Int) (v_ArrVal_1159 Int)) (let ((.cse12 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_1163)))) (let ((.cse9 (store (select .cse12 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse10 (select (store .cse12 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse9) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse8 (select .cse10 0))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse9) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse10 4 v_ArrVal_1169)) .cse8) (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_1164)))) (store .cse11 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0)))) (or (= .cse7 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1159) .cse7) 1) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| .cse8)))))))) (forall ((v_ArrVal_1163 Int) (v_ArrVal_1164 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int) (v_ArrVal_1169 Int) (v_ArrVal_1159 Int)) (let ((.cse14 (select (select (let ((.cse18 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_1164)))) (store .cse18 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0))) (let ((.cse13 (select (let ((.cse17 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_1163)))) (let ((.cse15 (store (select .cse17 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse16 (select (store .cse17 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse15) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse15) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse16 4 v_ArrVal_1169)) (select .cse16 0))))) .cse14))) (or (= .cse13 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1159) .cse13) 1) (= .cse14 0))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1163 Int) (v_ArrVal_1164 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int) (v_ArrVal_1169 Int) (v_ArrVal_1159 Int)) (let ((.cse25 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_1163)))) (let ((.cse21 (store (select .cse25 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse22 (select (store .cse25 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse21) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)) (.cse19 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_1164)))) (let ((.cse20 (store (select .cse19 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse23 (select .cse22 0)) (.cse24 (select v_ArrVal_1170 0))) (or (not (= (store (select (store .cse19 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse20) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 4 (select v_ArrVal_1170 4)) v_ArrVal_1170)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1159) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse21) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse22 4 v_ArrVal_1169)) .cse23) .cse24)) 1) (= .cse24 0) (= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse20) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1170) .cse23) .cse24))))))))) is different from false [2023-11-23 15:52:59,448 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse9 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1163 Int) (v_ArrVal_1164 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int) (v_ArrVal_1158 Int) (v_ArrVal_1157 Int) (v_ArrVal_1159 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse11 .cse9 v_ArrVal_1157)))) (let ((.cse10 (store .cse1 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse1 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1163)))) (let ((.cse2 (store (select .cse10 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse3 (select (store .cse10 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse2) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse0 (select .cse3 0))) (or (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| .cse0) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 .cse9 v_ArrVal_1158)))) (let ((.cse5 (store .cse7 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse7 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1164)))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse4 (select v_ArrVal_1170 0))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1159) (select (select (store (store .cse1 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse2) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse3 4 v_ArrVal_1169)) .cse0) .cse4)) 1) (not (= (store (select (store .cse5 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse6) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 4 (select v_ArrVal_1170 4)) v_ArrVal_1170)) (= (select (select (store (store .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse6) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1170) .cse0) .cse4) 0))))))))))))) (forall ((v_ArrVal_1163 Int) (v_ArrVal_1164 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int) (v_ArrVal_1158 Int) (v_ArrVal_1169 Int) (v_ArrVal_1157 Int) (v_ArrVal_1159 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse11 .cse9 v_ArrVal_1157)))) (let ((.cse19 (store .cse14 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse14 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1163)))) (let ((.cse15 (store (select .cse19 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse16 (select (store .cse19 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse15) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse13 (select .cse16 0))) (let ((.cse12 (select (select (store (store .cse14 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse15) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse16 4 v_ArrVal_1169)) .cse13) (select (select (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 .cse9 v_ArrVal_1158)))) (store .cse18 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse18 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1164))))) (store .cse17 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse17 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1159) .cse12) 1) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| .cse13) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| .cse12))))))))) (forall ((v_ArrVal_1163 Int) (v_ArrVal_1164 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int) (v_ArrVal_1158 Int) (v_ArrVal_1169 Int) (v_ArrVal_1157 Int) (v_ArrVal_1159 Int)) (let ((.cse21 (select (select (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 .cse9 v_ArrVal_1158)))) (store .cse27 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse27 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1164))))) (store .cse26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse26 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0))) (let ((.cse20 (select (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse11 .cse9 v_ArrVal_1157)))) (let ((.cse25 (store .cse22 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse22 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1163)))) (let ((.cse23 (store (select .cse25 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse24 (select (store .cse25 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse23) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (select (store (store .cse22 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse23) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse24 4 v_ArrVal_1169)) (select .cse24 0)))))) .cse21))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1159) .cse20) 1) (= .cse21 0) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| .cse20))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1163 Int) (v_ArrVal_1164 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| Int) (v_ArrVal_1158 Int) (v_ArrVal_1169 Int) (v_ArrVal_1157 Int) (v_ArrVal_1159 Int)) (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse11 .cse9 v_ArrVal_1157)))) (let ((.cse36 (store .cse28 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse28 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1163)))) (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 .cse9 v_ArrVal_1158))) (.cse29 (store (select .cse36 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|))) (let ((.cse30 (select (store .cse36 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse29) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|)) (.cse33 (store .cse35 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store (store (select .cse35 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1164)))) (let ((.cse34 (store (select .cse33 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse31 (select .cse30 0)) (.cse32 (select v_ArrVal_1170 0))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1159) (select (select (store (store .cse28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse29) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| (store .cse30 4 v_ArrVal_1169)) .cse31) .cse32)) 1) (not (= (store (select (store .cse33 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse34) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53|) 4 (select v_ArrVal_1170 4)) v_ArrVal_1170)) (= .cse32 0) (= (select (select (store (store .cse35 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse34) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_53| v_ArrVal_1170) .cse31) .cse32) 0)))))))))) is different from false [2023-11-23 15:52:59,905 INFO L349 Elim1Store]: treesize reduction 327, result has 32.9 percent of original size [2023-11-23 15:52:59,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 250 treesize of output 329 [2023-11-23 15:52:59,915 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:59,921 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:59,924 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:52:59,928 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:53:00,265 INFO L349 Elim1Store]: treesize reduction 171, result has 48.3 percent of original size [2023-11-23 15:53:00,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 323 treesize of output 320 [2023-11-23 15:53:00,511 INFO L349 Elim1Store]: treesize reduction 232, result has 22.7 percent of original size [2023-11-23 15:53:00,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 674 treesize of output 626 [2023-11-23 15:53:00,766 INFO L349 Elim1Store]: treesize reduction 304, result has 18.3 percent of original size [2023-11-23 15:53:00,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 717 treesize of output 794 [2023-11-23 15:53:01,061 INFO L349 Elim1Store]: treesize reduction 48, result has 37.7 percent of original size [2023-11-23 15:53:01,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 210 treesize of output 201 [2023-11-23 15:53:01,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:53:01,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 449 treesize of output 435 [2023-11-23 15:53:01,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 15:53:01,711 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 27 treesize of output 23 [2023-11-23 15:53:01,749 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 27 treesize of output 23 [2023-11-23 15:53:01,882 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:53:01,882 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 13 [2023-11-23 15:53:01,960 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:53:01,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:53:01,973 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2023-11-23 15:53:02,081 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:53:02,096 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2023-11-23 15:53:02,097 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 37 treesize of output 42 [2023-11-23 15:53:02,167 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:53:02,167 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 13 [2023-11-23 15:53:02,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 233 [2023-11-23 15:53:02,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 320 treesize of output 298 [2023-11-23 15:53:02,755 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:53:02,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:53:02,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 200 [2023-11-23 15:53:03,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:53:03,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 512 treesize of output 498 [2023-11-23 15:53:04,259 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:53:04,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:53:04,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 380 treesize of output 374 [2023-11-23 15:53:05,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:53:05,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:53:05,068 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 3871 treesize of output 3773 [2023-11-23 15:53:06,216 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:53:06,216 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:53:06,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:53:06,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 3832 treesize of output 3686 [2023-11-23 15:53:10,675 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-23 15:53:10,678 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 10121 treesize of output 9713 [2023-11-23 15:53:10,881 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:53:10,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:53:10,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 11053 treesize of output 10443 [2023-11-23 15:53:54,539 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:53:54,541 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:53:55,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:53:55,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 43185 treesize of output 35697 Killed by 15