./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_circular_traversal-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --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:20:35,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 15:20:35,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 15:20:35,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 15:20:35,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 15:20:35,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 15:20:35,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 15:20:35,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 15:20:35,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 15:20:35,816 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 15:20:35,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 15:20:35,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 15:20:35,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 15:20:35,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 15:20:35,818 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 15:20:35,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 15:20:35,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 15:20:35,819 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 15:20:35,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 15:20:35,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 15:20:35,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 15:20:35,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 15:20:35,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 15:20:35,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 15:20:35,820 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 15:20:35,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 15:20:35,821 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 15:20:35,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 15:20:35,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 15:20:35,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 15:20:35,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 15:20:35,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 15:20:35,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 15:20:35,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 15:20:35,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 15:20:35,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 15:20:35,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 15:20:35,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 15:20:35,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 15:20:35,825 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 15:20:35,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 15:20:35,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 15:20:35,825 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 ! call(reach_error())) ) 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:20:36,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 15:20:36,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 15:20:36,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 15:20:36,050 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 15:20:36,050 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 15:20:36,051 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:20:37,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 15:20:37,328 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 15:20:37,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_circular_traversal-1.i [2023-11-23 15:20:37,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25e5d523/db45aa068cd746ea850976bbe2f148b1/FLAGaacee4748 [2023-11-23 15:20:37,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25e5d523/db45aa068cd746ea850976bbe2f148b1 [2023-11-23 15:20:37,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 15:20:37,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 15:20:37,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 15:20:37,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 15:20:37,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 15:20:37,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:20:37" (1/1) ... [2023-11-23 15:20:37,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3413039f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:37, skipping insertion in model container [2023-11-23 15:20:37,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:20:37" (1/1) ... [2023-11-23 15:20:37,404 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 15:20:37,589 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-11-23 15:20:37,594 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 15:20:37,602 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 15:20:37,641 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-11-23 15:20:37,642 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 15:20:37,664 INFO L206 MainTranslator]: Completed translation [2023-11-23 15:20:37,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:37 WrapperNode [2023-11-23 15:20:37,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 15:20:37,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 15:20:37,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 15:20:37,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 15:20:37,671 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:20:37" (1/1) ... [2023-11-23 15:20:37,685 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:20:37" (1/1) ... [2023-11-23 15:20:37,699 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2023-11-23 15:20:37,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 15:20:37,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 15:20:37,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 15:20:37,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 15:20:37,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:37" (1/1) ... [2023-11-23 15:20:37,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:37" (1/1) ... [2023-11-23 15:20:37,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:37" (1/1) ... [2023-11-23 15:20:37,722 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2023-11-23 15:20:37,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:37" (1/1) ... [2023-11-23 15:20:37,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:37" (1/1) ... [2023-11-23 15:20:37,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:37" (1/1) ... [2023-11-23 15:20:37,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:37" (1/1) ... [2023-11-23 15:20:37,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:37" (1/1) ... [2023-11-23 15:20:37,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:37" (1/1) ... [2023-11-23 15:20:37,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 15:20:37,734 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 15:20:37,734 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 15:20:37,734 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 15:20:37,735 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:37" (1/1) ... [2023-11-23 15:20:37,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 15:20:37,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:20:37,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 15:20:37,768 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:20:37,824 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-23 15:20:37,824 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-23 15:20:37,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 15:20:37,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 15:20:37,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 15:20:37,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 15:20:37,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 15:20:37,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 15:20:37,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 15:20:37,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 15:20:37,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 15:20:37,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 15:20:37,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 15:20:37,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 15:20:37,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 15:20:37,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 15:20:37,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 15:20:37,988 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 15:20:37,990 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 15:20:38,029 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-23 15:20:38,144 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 15:20:38,163 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 15:20:38,164 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-23 15:20:38,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:20:38 BoogieIcfgContainer [2023-11-23 15:20:38,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 15:20:38,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 15:20:38,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 15:20:38,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 15:20:38,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:20:37" (1/3) ... [2023-11-23 15:20:38,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c38d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:20:38, skipping insertion in model container [2023-11-23 15:20:38,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:37" (2/3) ... [2023-11-23 15:20:38,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c38d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:20:38, skipping insertion in model container [2023-11-23 15:20:38,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:20:38" (3/3) ... [2023-11-23 15:20:38,171 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2023-11-23 15:20:38,185 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 15:20:38,185 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 15:20:38,222 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 15:20:38,227 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e8ed9d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 15:20:38,228 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 15:20:38,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 23 states have internal predecessors, (33), 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:20:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-23 15:20:38,236 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:20:38,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:20:38,237 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 15:20:38,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:20:38,240 INFO L85 PathProgramCache]: Analyzing trace with hash -332904746, now seen corresponding path program 1 times [2023-11-23 15:20:38,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:20:38,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226514787] [2023-11-23 15:20:38,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:20:38,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:20:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:20:38,392 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:20:38,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:20:38,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226514787] [2023-11-23 15:20:38,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226514787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:20:38,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:20:38,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 15:20:38,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98310978] [2023-11-23 15:20:38,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:20:38,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 15:20:38,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:20:38,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 15:20:38,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 15:20:38,421 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 23 states have internal predecessors, (33), 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:20:38,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:20:38,453 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2023-11-23 15:20:38,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 15:20:38,456 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2023-11-23 15:20:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:20:38,461 INFO L225 Difference]: With dead ends: 40 [2023-11-23 15:20:38,462 INFO L226 Difference]: Without dead ends: 18 [2023-11-23 15:20:38,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 15:20:38,468 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:20:38,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:20:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-23 15:20:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-23 15:20:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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:20:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-11-23 15:20:38,493 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 8 [2023-11-23 15:20:38,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:20:38,493 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-23 15:20:38,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:20:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-11-23 15:20:38,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-23 15:20:38,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:20:38,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:20:38,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 15:20:38,495 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 15:20:38,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:20:38,496 INFO L85 PathProgramCache]: Analyzing trace with hash -343986998, now seen corresponding path program 1 times [2023-11-23 15:20:38,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:20:38,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433153101] [2023-11-23 15:20:38,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:20:38,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:20:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:20:38,673 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:20:38,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:20:38,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433153101] [2023-11-23 15:20:38,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433153101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:20:38,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:20:38,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 15:20:38,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396228205] [2023-11-23 15:20:38,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:20:38,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 15:20:38,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:20:38,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 15:20:38,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:20:38,680 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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:20:38,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:20:38,701 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2023-11-23 15:20:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 15:20:38,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2023-11-23 15:20:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:20:38,702 INFO L225 Difference]: With dead ends: 33 [2023-11-23 15:20:38,702 INFO L226 Difference]: Without dead ends: 21 [2023-11-23 15:20:38,703 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:20:38,704 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:20:38,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 33 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:20:38,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-23 15:20:38,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-11-23 15:20:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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:20:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-11-23 15:20:38,710 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 8 [2023-11-23 15:20:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:20:38,710 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-11-23 15:20:38,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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:20:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-11-23 15:20:38,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-23 15:20:38,711 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:20:38,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:20:38,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 15:20:38,712 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 15:20:38,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:20:38,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2006919056, now seen corresponding path program 1 times [2023-11-23 15:20:38,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:20:38,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252250507] [2023-11-23 15:20:38,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:20:38,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:20:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:20:38,841 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:20:38,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:20:38,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252250507] [2023-11-23 15:20:38,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252250507] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:20:38,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285853163] [2023-11-23 15:20:38,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:20:38,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:20:38,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:20:38,865 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:20:38,899 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:20:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:20:38,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 15:20:38,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:20:39,028 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:20:39,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:20:39,053 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:20:39,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285853163] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:20:39,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:20:39,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-23 15:20:39,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597425818] [2023-11-23 15:20:39,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:20:39,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 15:20:39,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:20:39,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 15:20:39,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-23 15:20:39,061 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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:20:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:20:39,094 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2023-11-23 15:20:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 15:20:39,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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:20:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:20:39,095 INFO L225 Difference]: With dead ends: 40 [2023-11-23 15:20:39,095 INFO L226 Difference]: Without dead ends: 28 [2023-11-23 15:20:39,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-23 15:20:39,099 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:20:39,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 35 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:20:39,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-23 15:20:39,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-23 15:20:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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:20:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-11-23 15:20:39,107 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 11 [2023-11-23 15:20:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:20:39,107 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-11-23 15:20:39,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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:20:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-11-23 15:20:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 15:20:39,108 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:20:39,108 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:20:39,120 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:20:39,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:20:39,321 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 15:20:39,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:20:39,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1890277046, now seen corresponding path program 2 times [2023-11-23 15:20:39,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:20:39,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344557094] [2023-11-23 15:20:39,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:20:39,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:20:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:20:39,957 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 15:20:39,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:20:39,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344557094] [2023-11-23 15:20:39,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344557094] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:20:39,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764586117] [2023-11-23 15:20:39,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 15:20:39,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:20:39,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:20:39,977 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:20:40,005 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:20:40,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 15:20:40,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 15:20:40,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-23 15:20:40,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:20:40,266 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:20:40,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 15:20:40,315 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:20:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 15:20:40,355 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:20:40,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:20:40,482 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 44 treesize of output 34 [2023-11-23 15:20:40,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:20:40,505 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 47 treesize of output 49 [2023-11-23 15:20:40,542 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 41 treesize of output 29 [2023-11-23 15:20:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 15:20:40,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764586117] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:20:40,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:20:40,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 18 [2023-11-23 15:20:40,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853050435] [2023-11-23 15:20:40,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:20:40,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-23 15:20:40,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:20:40,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-23 15:20:40,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=282, Unknown=5, NotChecked=0, Total=342 [2023-11-23 15:20:40,610 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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:20:40,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:20:40,777 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2023-11-23 15:20:40,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 15:20:40,778 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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 20 [2023-11-23 15:20:40,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:20:40,778 INFO L225 Difference]: With dead ends: 32 [2023-11-23 15:20:40,778 INFO L226 Difference]: Without dead ends: 30 [2023-11-23 15:20:40,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=518, Unknown=5, NotChecked=0, Total=650 [2023-11-23 15:20:40,779 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:20:40,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:20:40,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-23 15:20:40,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-23 15:20:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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:20:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-11-23 15:20:40,783 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2023-11-23 15:20:40,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:20:40,783 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-23 15:20:40,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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:20:40,784 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-11-23 15:20:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 15:20:40,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:20:40,784 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:20:40,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 15:20:40,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-11-23 15:20:40,995 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 15:20:40,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:20:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1926323958, now seen corresponding path program 1 times [2023-11-23 15:20:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:20:40,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944967209] [2023-11-23 15:20:40,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:20:40,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:20:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:20:41,799 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 15:20:41,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:20:41,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944967209] [2023-11-23 15:20:41,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944967209] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:20:41,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103277837] [2023-11-23 15:20:41,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:20:41,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:20:41,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:20:41,817 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:20:41,844 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:20:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:20:41,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-23 15:20:41,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:20:42,002 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:20:42,074 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 22 treesize of output 1 [2023-11-23 15:20:42,086 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-23 15:20:42,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-23 15:20:42,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-23 15:20:42,158 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-23 15:20:42,159 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 31 treesize of output 30 [2023-11-23 15:20:42,164 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 27 treesize of output 15 [2023-11-23 15:20:42,175 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 15:20:42,176 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:20:42,293 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 15:20:42,293 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 37 [2023-11-23 15:20:42,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:20:42,302 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 34 [2023-11-23 15:20:42,310 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 15:20:42,310 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 45 treesize of output 36 [2023-11-23 15:20:42,323 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 15:20:42,324 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 31 treesize of output 30 [2023-11-23 15:20:42,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:20:42,331 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:20:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 15:20:42,408 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:20:42,518 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_388 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |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|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_388) .cse0) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |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|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (not (= v_ArrVal_385 (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|))))))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_388 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |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|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_388) (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |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|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (+ .cse1 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_385 (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))))) is different from false [2023-11-23 15:20:42,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:20:42,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 482 treesize of output 498 [2023-11-23 15:20:42,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:20:42,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 681 treesize of output 693 [2023-11-23 15:20:42,791 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 15:20:42,903 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (forall ((v_ArrVal_388 (Array Int Int))) (or (= (select v_ArrVal_388 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_385) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (not (= v_ArrVal_385 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_379) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (forall ((v_ArrVal_388 (Array Int Int))) (or (= (select v_ArrVal_388 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_385) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (not (= v_ArrVal_385 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_379) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_385) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_385 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_379) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse2) (or (and (forall ((v_ArrVal_388 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1)) (= (select v_ArrVal_388 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_ArrVal_388 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1))))) .cse2) (or (and (forall ((v_prenex_1 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_1) (forall ((v_prenex_2 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_379) v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_2 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_2)) (forall ((v_prenex_3 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| v_prenex_1 v_prenex_2) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_3) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1)) (= (select v_prenex_3 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (or (and (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_379 (Array Int Int))) (or (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_379) v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_2 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_2)) (forall ((v_prenex_3 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| v_prenex_1 v_prenex_2) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_3) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1)) (= (select v_prenex_3 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_379 (Array Int Int))) (or (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_379) v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_2 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| v_prenex_1 v_prenex_2) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_3) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1))))) .cse2) (forall ((v_prenex_1 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_1) (forall ((v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_379) v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_2 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| v_prenex_1 v_prenex_2) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_3) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1))))))) .cse3) (or (and (forall ((v_prenex_3 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_3) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_3 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_3 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_3) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse3 .cse2) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_385) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_385 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_379) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))) is different from false [2023-11-23 15:20:43,233 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse1 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (or (and (or (and (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_379 (Array Int Int))) (or (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_379) v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_2 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| v_prenex_1 v_prenex_2) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_3) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_379 (Array Int Int))) (or (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_379) v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_2 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_2)) (forall ((v_prenex_3 (Array Int Int))) (or (= (select v_prenex_3 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| v_prenex_1 v_prenex_2) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_3) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))))))) .cse1) (forall ((v_prenex_1 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_1) (forall ((v_prenex_2 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_379) v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_2 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_2)) (forall ((v_prenex_3 (Array Int Int))) (or (= (select v_prenex_3 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| v_prenex_1 v_prenex_2) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_3) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))))))) (forall ((v_prenex_1 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_1) (forall ((v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (not (= (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_379) v_prenex_1) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_prenex_2 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) v_prenex_2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| v_prenex_1 v_prenex_2) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_3) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))))))) .cse2) (or .cse1 (and (forall ((v_ArrVal_388 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)) (= (select v_ArrVal_388 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_ArrVal_388 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (forall ((v_ArrVal_388 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_385) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_388 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (not (= v_ArrVal_385 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_379) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (and (forall ((v_prenex_3 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_prenex_3 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_3) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_3 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_3) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse1 .cse2) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_385) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_385 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_379) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (forall ((v_ArrVal_388 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_385) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_388 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (not (= v_ArrVal_385 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_379) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|))))))))) .cse1) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_388 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_385) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_385 (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_379) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select v_ArrVal_385 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))) is different from false [2023-11-23 15:20:43,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:20:43,314 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 50 treesize of output 40 [2023-11-23 15:20:43,316 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:20:43,317 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:20:43,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:20:43,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 49 [2023-11-23 15:20:43,341 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 41 treesize of output 29 [2023-11-23 15:20:43,352 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-23 15:20:43,352 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 50 treesize of output 1 [2023-11-23 15:20:43,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:20:43,358 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 22 treesize of output 23 [2023-11-23 15:20:43,361 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:20:43,364 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:20:43,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:20:43,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 40 [2023-11-23 15:20:43,376 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 15:20:43,384 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-23 15:20:43,385 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 81 treesize of output 78 [2023-11-23 15:20:43,390 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 11 treesize of output 7 [2023-11-23 15:20:43,393 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 21 treesize of output 13 [2023-11-23 15:20:43,404 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 15:20:43,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2023-11-23 15:20:43,409 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 15:20:43,410 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 18 treesize of output 1 [2023-11-23 15:20:43,418 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 15:20:43,418 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 44 treesize of output 1 [2023-11-23 15:20:43,424 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 15:20:43,424 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 44 treesize of output 1 [2023-11-23 15:20:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 13 not checked. [2023-11-23 15:20:43,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103277837] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:20:43,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:20:43,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2023-11-23 15:20:43,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699690135] [2023-11-23 15:20:43,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:20:43,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-23 15:20:43,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:20:43,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-23 15:20:43,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=575, Unknown=3, NotChecked=150, Total=812 [2023-11-23 15:20:43,488 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 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:20:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:20:44,286 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2023-11-23 15:20:44,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 15:20:44,287 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 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) Word has length 23 [2023-11-23 15:20:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:20:44,288 INFO L225 Difference]: With dead ends: 50 [2023-11-23 15:20:44,288 INFO L226 Difference]: Without dead ends: 48 [2023-11-23 15:20:44,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=219, Invalid=1122, Unknown=3, NotChecked=216, Total=1560 [2023-11-23 15:20:44,289 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 38 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 15:20:44,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 112 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 265 Invalid, 0 Unknown, 117 Unchecked, 0.2s Time] [2023-11-23 15:20:44,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-23 15:20:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2023-11-23 15:20:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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:20:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-11-23 15:20:44,294 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 23 [2023-11-23 15:20:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:20:44,294 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-11-23 15:20:44,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 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:20:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-11-23 15:20:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 15:20:44,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:20:44,295 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:20:44,324 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:20:44,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:20:44,506 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 15:20:44,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:20:44,507 INFO L85 PathProgramCache]: Analyzing trace with hash 412114079, now seen corresponding path program 1 times [2023-11-23 15:20:44,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:20:44,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878625348] [2023-11-23 15:20:44,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:20:44,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:20:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:20:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 15:20:44,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:20:44,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878625348] [2023-11-23 15:20:44,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878625348] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:20:44,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263314787] [2023-11-23 15:20:44,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:20:44,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:20:44,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:20:44,897 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:20:44,923 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:20:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:20:45,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-23 15:20:45,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:20:45,007 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:20:45,020 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 15:20:45,020 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:20:45,030 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 15:20:45,031 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:20:45,047 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 15:20:45,048 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:20:45,086 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-23 15:20:45,087 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:20:45,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-11-23 15:20:45,146 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 18 [2023-11-23 15:20:45,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-23 15:20:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 15:20:45,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:20:45,188 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_543) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2023-11-23 15:20:45,193 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 41 treesize of output 39 [2023-11-23 15:20:45,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-11-23 15:20:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 4 not checked. [2023-11-23 15:20:45,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263314787] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:20:45,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:20:45,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2023-11-23 15:20:45,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741054258] [2023-11-23 15:20:45,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:20:45,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-23 15:20:45,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:20:45,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-23 15:20:45,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=348, Unknown=1, NotChecked=38, Total=462 [2023-11-23 15:20:45,395 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 22 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 21 states have internal predecessors, (51), 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:20:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:20:45,615 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-11-23 15:20:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 15:20:45,616 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 21 states have internal predecessors, (51), 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 24 [2023-11-23 15:20:45,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:20:45,617 INFO L225 Difference]: With dead ends: 41 [2023-11-23 15:20:45,617 INFO L226 Difference]: Without dead ends: 33 [2023-11-23 15:20:45,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=542, Unknown=1, NotChecked=50, Total=756 [2023-11-23 15:20:45,618 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:20:45,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 112 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 17 Unchecked, 0.1s Time] [2023-11-23 15:20:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-23 15:20:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-23 15:20:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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:20:45,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2023-11-23 15:20:45,621 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 24 [2023-11-23 15:20:45,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:20:45,621 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2023-11-23 15:20:45,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 21 states have internal predecessors, (51), 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:20:45,621 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2023-11-23 15:20:45,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 15:20:45,622 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:20:45,622 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:20:45,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 15:20:45,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:20:45,833 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 15:20:45,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:20:45,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2058055350, now seen corresponding path program 2 times [2023-11-23 15:20:45,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:20:45,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609153197] [2023-11-23 15:20:45,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:20:45,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:20:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:20:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:20:47,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:20:47,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609153197] [2023-11-23 15:20:47,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609153197] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:20:47,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105924661] [2023-11-23 15:20:47,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 15:20:47,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:20:47,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:20:47,113 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:20:47,128 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:20:47,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 15:20:47,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 15:20:47,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 98 conjunts are in the unsatisfiable core [2023-11-23 15:20:47,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:20:47,299 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:20:47,336 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:20:47,374 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 15:20:47,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-23 15:20:47,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-23 15:20:47,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2023-11-23 15:20:47,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-23 15:20:47,558 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-23 15:20:47,558 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 30 treesize of output 22 [2023-11-23 15:20:47,573 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-11-23 15:20:47,574 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 54 treesize of output 35 [2023-11-23 15:20:47,584 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 15:20:47,585 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 16 treesize of output 15 [2023-11-23 15:20:47,716 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-11-23 15:20:47,716 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 91 treesize of output 80 [2023-11-23 15:20:47,725 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 15:20:47,725 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 39 [2023-11-23 15:20:47,744 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-23 15:20:47,745 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 3 case distinctions, treesize of input 26 treesize of output 28 [2023-11-23 15:20:48,097 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2023-11-23 15:20:48,098 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 191 treesize of output 146 [2023-11-23 15:20:48,179 INFO L349 Elim1Store]: treesize reduction 72, result has 66.8 percent of original size [2023-11-23 15:20:48,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 184 treesize of output 300 [2023-11-23 15:20:48,193 INFO L349 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2023-11-23 15:20:48,194 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 178 treesize of output 178 [2023-11-23 15:21:48,692 WARN L293 SmtUtils]: Spent 17.06s on a formula simplification. DAG size of input: 1545 DAG size of output: 1523 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15