./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i --full-output --preprocessor.use.memory.slicer false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 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-ext2-properties/simple_search_value-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 9339a3186df1139a7984a9803a310ef99d020bdafafac2d122ebd6ff2b132483 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-23 00:07:05,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 00:07:05,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 00:07:05,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 00:07:05,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 00:07:05,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 00:07:05,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 00:07:05,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 00:07:05,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 00:07:05,827 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 00:07:05,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 00:07:05,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 00:07:05,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 00:07:05,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 00:07:05,829 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 00:07:05,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 00:07:05,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 00:07:05,830 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 00:07:05,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 00:07:05,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 00:07:05,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 00:07:05,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 00:07:05,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 00:07:05,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 00:07:05,831 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 00:07:05,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 00:07:05,832 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 00:07:05,832 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 00:07:05,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 00:07:05,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 00:07:05,834 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 00:07:05,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 00:07:05,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 00:07:05,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 00:07:05,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 00:07:05,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 00:07:05,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 00:07:05,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 00:07:05,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 00:07:05,835 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 00:07:05,835 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 00:07:05,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 00:07:05,836 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 -> 9339a3186df1139a7984a9803a310ef99d020bdafafac2d122ebd6ff2b132483 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 00:07:05,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 00:07:06,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 00:07:06,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 00:07:06,012 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 00:07:06,012 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 00:07:06,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i [2023-11-23 00:07:06,990 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 00:07:07,199 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 00:07:07,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i [2023-11-23 00:07:07,211 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f434a09/bae27c2a0fed4430afdf996bd8136b90/FLAG216a9d788 [2023-11-23 00:07:07,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f434a09/bae27c2a0fed4430afdf996bd8136b90 [2023-11-23 00:07:07,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 00:07:07,224 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 00:07:07,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 00:07:07,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 00:07:07,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 00:07:07,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:07:07" (1/1) ... [2023-11-23 00:07:07,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@217b9e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:07:07, skipping insertion in model container [2023-11-23 00:07:07,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:07:07" (1/1) ... [2023-11-23 00:07:07,260 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 00:07:07,485 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-ext2-properties/simple_search_value-1.i[23210,23223] [2023-11-23 00:07:07,490 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 00:07:07,500 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 00:07:07,537 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-ext2-properties/simple_search_value-1.i[23210,23223] [2023-11-23 00:07:07,538 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 00:07:07,571 INFO L206 MainTranslator]: Completed translation [2023-11-23 00:07:07,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:07:07 WrapperNode [2023-11-23 00:07:07,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 00:07:07,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 00:07:07,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 00:07:07,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 00:07:07,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:07:07" (1/1) ... [2023-11-23 00:07:07,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:07:07" (1/1) ... [2023-11-23 00:07:07,616 INFO L138 Inliner]: procedures = 122, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2023-11-23 00:07:07,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 00:07:07,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 00:07:07,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 00:07:07,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 00:07:07,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:07:07" (1/1) ... [2023-11-23 00:07:07,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:07:07" (1/1) ... [2023-11-23 00:07:07,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:07:07" (1/1) ... [2023-11-23 00:07:07,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:07:07" (1/1) ... [2023-11-23 00:07:07,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:07:07" (1/1) ... [2023-11-23 00:07:07,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:07:07" (1/1) ... [2023-11-23 00:07:07,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:07:07" (1/1) ... [2023-11-23 00:07:07,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:07:07" (1/1) ... [2023-11-23 00:07:07,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 00:07:07,647 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 00:07:07,647 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 00:07:07,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 00:07:07,648 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:07:07" (1/1) ... [2023-11-23 00:07:07,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 00:07:07,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 00:07:07,685 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 00:07:07,696 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 00:07:07,733 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-23 00:07:07,734 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-23 00:07:07,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 00:07:07,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 00:07:07,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 00:07:07,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 00:07:07,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 00:07:07,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 00:07:07,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 00:07:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 00:07:07,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 00:07:07,814 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 00:07:07,816 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 00:07:07,896 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-23 00:07:08,005 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 00:07:08,026 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 00:07:08,026 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 00:07:08,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:07:08 BoogieIcfgContainer [2023-11-23 00:07:08,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 00:07:08,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 00:07:08,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 00:07:08,031 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 00:07:08,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:07:07" (1/3) ... [2023-11-23 00:07:08,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea25d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:07:08, skipping insertion in model container [2023-11-23 00:07:08,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:07:07" (2/3) ... [2023-11-23 00:07:08,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea25d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:07:08, skipping insertion in model container [2023-11-23 00:07:08,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:07:08" (3/3) ... [2023-11-23 00:07:08,033 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_search_value-1.i [2023-11-23 00:07:08,046 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 00:07:08,046 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 00:07:08,076 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 00:07:08,081 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;@3200ad11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 00:07:08,081 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 00:07:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 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 00:07:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-23 00:07:08,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:07:08,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:07:08,089 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:07:08,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:07:08,093 INFO L85 PathProgramCache]: Analyzing trace with hash 357278617, now seen corresponding path program 1 times [2023-11-23 00:07:08,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:07:08,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581602863] [2023-11-23 00:07:08,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:07:08,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:07:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:07:08,222 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 00:07:08,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:07:08,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581602863] [2023-11-23 00:07:08,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581602863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:07:08,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:07:08,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 00:07:08,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088244480] [2023-11-23 00:07:08,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:07:08,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 00:07:08,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:07:08,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 00:07:08,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 00:07:08,261 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 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 00:07:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:07:08,291 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2023-11-23 00:07:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 00:07:08,295 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 00:07:08,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:07:08,300 INFO L225 Difference]: With dead ends: 34 [2023-11-23 00:07:08,301 INFO L226 Difference]: Without dead ends: 17 [2023-11-23 00:07:08,303 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 00:07:08,308 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 00:07:08,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 00:07:08,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-23 00:07:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-11-23 00:07:08,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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 00:07:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-11-23 00:07:08,345 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 8 [2023-11-23 00:07:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:07:08,345 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-23 00:07:08,345 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 00:07:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-11-23 00:07:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-23 00:07:08,346 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:07:08,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:07:08,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 00:07:08,347 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:07:08,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:07:08,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1991764778, now seen corresponding path program 1 times [2023-11-23 00:07:08,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:07:08,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417920994] [2023-11-23 00:07:08,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:07:08,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:07:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:07:08,473 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 00:07:08,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:07:08,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417920994] [2023-11-23 00:07:08,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417920994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:07:08,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:07:08,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:07:08,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672452915] [2023-11-23 00:07:08,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:07:08,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 00:07:08,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:07:08,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 00:07:08,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 00:07:08,478 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 00:07:08,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:07:08,517 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2023-11-23 00:07:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 00:07:08,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2023-11-23 00:07:08,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:07:08,519 INFO L225 Difference]: With dead ends: 27 [2023-11-23 00:07:08,519 INFO L226 Difference]: Without dead ends: 18 [2023-11-23 00:07:08,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 00:07:08,521 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 00:07:08,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 00:07:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-23 00:07:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-23 00:07:08,526 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 00:07:08,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-11-23 00:07:08,528 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-11-23 00:07:08,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:07:08,528 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-23 00:07:08,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 00:07:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-11-23 00:07:08,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-23 00:07:08,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:07:08,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:07:08,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 00:07:08,532 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:07:08,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:07:08,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2049023080, now seen corresponding path program 1 times [2023-11-23 00:07:08,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:07:08,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245196329] [2023-11-23 00:07:08,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:07:08,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:07:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:07:08,681 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 00:07:08,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:07:08,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245196329] [2023-11-23 00:07:08,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245196329] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:07:08,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:07:08,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 00:07:08,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54967156] [2023-11-23 00:07:08,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:07:08,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 00:07:08,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:07:08,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 00:07:08,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 00:07:08,682 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 00:07:08,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:07:08,723 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2023-11-23 00:07:08,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 00:07:08,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2023-11-23 00:07:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:07:08,726 INFO L225 Difference]: With dead ends: 38 [2023-11-23 00:07:08,726 INFO L226 Difference]: Without dead ends: 23 [2023-11-23 00:07:08,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 00:07:08,727 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 00:07:08,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 00:07:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-23 00:07:08,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-11-23 00:07:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 00:07:08,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-11-23 00:07:08,730 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2023-11-23 00:07:08,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:07:08,731 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-23 00:07:08,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 00:07:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-23 00:07:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 00:07:08,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:07:08,731 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:07:08,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 00:07:08,731 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:07:08,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:07:08,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1438995548, now seen corresponding path program 1 times [2023-11-23 00:07:08,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:07:08,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243642939] [2023-11-23 00:07:08,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:07:08,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:07:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:07:08,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 00:07:08,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:07:08,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243642939] [2023-11-23 00:07:08,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243642939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:07:08,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:07:08,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:07:08,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992170775] [2023-11-23 00:07:08,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:07:08,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 00:07:08,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:07:08,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 00:07:08,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 00:07:08,802 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 00:07:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:07:08,839 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2023-11-23 00:07:08,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 00:07:08,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 15 [2023-11-23 00:07:08,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:07:08,840 INFO L225 Difference]: With dead ends: 31 [2023-11-23 00:07:08,841 INFO L226 Difference]: Without dead ends: 28 [2023-11-23 00:07:08,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 00:07:08,842 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 00:07:08,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 23 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 00:07:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-23 00:07:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2023-11-23 00:07:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 00:07:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-23 00:07:08,853 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2023-11-23 00:07:08,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:07:08,853 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-23 00:07:08,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 00:07:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-23 00:07:08,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 00:07:08,854 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:07:08,854 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:07:08,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 00:07:08,855 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:07:08,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:07:08,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1477352526, now seen corresponding path program 1 times [2023-11-23 00:07:08,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:07:08,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024338197] [2023-11-23 00:07:08,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:07:08,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:07:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:07:08,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 00:07:08,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:07:08,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024338197] [2023-11-23 00:07:08,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024338197] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 00:07:08,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121609164] [2023-11-23 00:07:08,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:07:08,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 00:07:08,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 00:07:08,989 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 00:07:09,024 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 00:07:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:07:09,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 00:07:09,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 00:07:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 00:07:09,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 00:07:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 00:07:09,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121609164] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 00:07:09,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 00:07:09,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-23 00:07:09,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673965470] [2023-11-23 00:07:09,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 00:07:09,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 00:07:09,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:07:09,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 00:07:09,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-23 00:07:09,163 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 00:07:09,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:07:09,250 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2023-11-23 00:07:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 00:07:09,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 00:07:09,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:07:09,252 INFO L225 Difference]: With dead ends: 55 [2023-11-23 00:07:09,252 INFO L226 Difference]: Without dead ends: 39 [2023-11-23 00:07:09,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-11-23 00:07:09,255 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 00:07:09,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 00:07:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-23 00:07:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2023-11-23 00:07:09,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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 00:07:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-11-23 00:07:09,264 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 20 [2023-11-23 00:07:09,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:07:09,265 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-11-23 00:07:09,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 00:07:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-11-23 00:07:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-23 00:07:09,266 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:07:09,267 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:07:09,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 00:07:09,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 00:07:09,479 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:07:09,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:07:09,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1302450726, now seen corresponding path program 2 times [2023-11-23 00:07:09,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:07:09,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134396589] [2023-11-23 00:07:09,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:07:09,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:07:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:07:09,718 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 00:07:09,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:07:09,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134396589] [2023-11-23 00:07:09,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134396589] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 00:07:09,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629763623] [2023-11-23 00:07:09,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 00:07:09,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 00:07:09,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 00:07:09,724 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 00:07:09,756 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 00:07:09,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 00:07:09,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 00:07:09,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 00:07:09,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 00:07:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 00:07:09,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 00:07:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 00:07:10,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629763623] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 00:07:10,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 00:07:10,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-11-23 00:07:10,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501568314] [2023-11-23 00:07:10,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 00:07:10,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 00:07:10,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 00:07:10,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 00:07:10,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2023-11-23 00:07:10,024 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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 00:07:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:07:10,143 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2023-11-23 00:07:10,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-23 00:07:10,144 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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 35 [2023-11-23 00:07:10,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:07:10,144 INFO L225 Difference]: With dead ends: 85 [2023-11-23 00:07:10,145 INFO L226 Difference]: Without dead ends: 69 [2023-11-23 00:07:10,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2023-11-23 00:07:10,146 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 00:07:10,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 80 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 00:07:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-23 00:07:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2023-11-23 00:07:10,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:07:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2023-11-23 00:07:10,161 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 35 [2023-11-23 00:07:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:07:10,162 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2023-11-23 00:07:10,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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 00:07:10,162 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2023-11-23 00:07:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 00:07:10,163 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:07:10,163 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:07:10,177 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 00:07:10,372 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,SelfDestructingSolverStorable5 [2023-11-23 00:07:10,373 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:07:10,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:07:10,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2036934490, now seen corresponding path program 3 times [2023-11-23 00:07:10,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 00:07:10,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772916354] [2023-11-23 00:07:10,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:07:10,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 00:07:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:07:13,475 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 129 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-11-23 00:07:13,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 00:07:13,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772916354] [2023-11-23 00:07:13,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772916354] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 00:07:13,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694910494] [2023-11-23 00:07:13,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 00:07:13,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 00:07:13,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 00:07:13,492 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 00:07:13,493 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 00:07:22,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-23 00:07:22,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 00:07:22,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 153 conjunts are in the unsatisfiable core [2023-11-23 00:07:22,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 00:07:22,678 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 00:07:22,736 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 00:07:22,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-23 00:07:22,786 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 15 treesize of output 1 [2023-11-23 00:07:22,827 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 00:07:22,828 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 00:07:22,836 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-23 00:07:22,837 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 32 treesize of output 23 [2023-11-23 00:07:22,880 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2023-11-23 00:07:22,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 53 [2023-11-23 00:07:22,973 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-23 00:07:22,974 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 52 treesize of output 47 [2023-11-23 00:07:22,991 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 16 treesize of output 8 [2023-11-23 00:07:23,075 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-23 00:07:23,075 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 61 treesize of output 54 [2023-11-23 00:07:23,136 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 00:07:23,136 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 25 treesize of output 22 [2023-11-23 00:07:23,144 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 13 treesize of output 9 [2023-11-23 00:07:23,214 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-23 00:07:23,214 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 37 treesize of output 25 [2023-11-23 00:07:23,265 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 00:07:23,266 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 17 treesize of output 16 [2023-11-23 00:07:23,323 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-23 00:07:23,323 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 28 treesize of output 20 [2023-11-23 00:07:23,368 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 00:07:23,368 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 17 treesize of output 16 [2023-11-23 00:07:23,439 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-23 00:07:23,440 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 28 treesize of output 20 [2023-11-23 00:07:23,487 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 00:07:23,488 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 17 treesize of output 16 [2023-11-23 00:07:23,526 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-23 00:07:23,526 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 28 treesize of output 20 [2023-11-23 00:07:23,557 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 00:07:23,558 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 17 treesize of output 16 [2023-11-23 00:07:23,596 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-23 00:07:23,596 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 28 treesize of output 20 [2023-11-23 00:07:23,646 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 00:07:23,647 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 17 treesize of output 16 [2023-11-23 00:07:23,676 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-23 00:07:23,676 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 28 treesize of output 20 [2023-11-23 00:07:23,722 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 00:07:23,722 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 17 treesize of output 16 [2023-11-23 00:07:23,733 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 00:07:23,782 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 00:07:23,794 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 00:07:23,794 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 21 treesize of output 20 [2023-11-23 00:07:24,004 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2023-11-23 00:07:24,005 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 3 case distinctions, treesize of input 59 treesize of output 59 [2023-11-23 00:07:24,017 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 00:07:24,017 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 37 treesize of output 36 [2023-11-23 00:07:24,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:07:24,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 79 [2023-11-23 00:07:24,252 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 00:07:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-23 00:07:24,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 00:07:24,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:07:24,811 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 112 treesize of output 130 [2023-11-23 00:07:24,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2023-11-23 00:07:24,888 INFO L349 Elim1Store]: treesize reduction 28, result has 53.3 percent of original size [2023-11-23 00:07:24,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 48 [2023-11-23 00:07:24,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-11-23 00:07:24,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 00:07:25,025 INFO L349 Elim1Store]: treesize reduction 134, result has 36.2 percent of original size [2023-11-23 00:07:25,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 121 treesize of output 176 [2023-11-23 00:07:25,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:07:25,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 132 treesize of output 188 [2023-11-23 00:07:25,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:07:25,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 102 treesize of output 116 [2023-11-23 00:07:26,005 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 8 treesize of output 4 [2023-11-23 00:07:26,013 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (and (forall ((v_ArrVal_613 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_609 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_609) |v_ULTIMATE.start_main_~p~0#1.base_45| v_ArrVal_613) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_45| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_613 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_609 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_609) |v_ULTIMATE.start_main_~p~0#1.base_45| v_ArrVal_613) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0))) .cse1))) (or (and (forall ((v_ArrVal_613 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_609 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_609) |v_ULTIMATE.start_main_~p~0#1.base_45| v_ArrVal_613) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| 4))) .cse1) (forall ((v_ArrVal_613 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_609 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_609) |v_ULTIMATE.start_main_~p~0#1.base_45| v_ArrVal_613) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_45| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))))) is different from false [2023-11-23 00:07:26,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:07:26,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 109 [2023-11-23 00:07:28,294 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select v_arrayElimArr_3 .cse0) 0) (forall ((v_prenex_7 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_subst_1 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (or (= v_prenex_7 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_1 v_prenex_6) v_prenex_7 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)))))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_10 Int) (v_subst_2 Int)) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_2 v_prenex_9) v_prenex_10 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_3 .cse0) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2))) .cse2) (or (and (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select v_arrayElimArr_3 .cse0) 0) (forall ((v_ArrVal_613 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_609 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (v_subst_4 Int)) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_4 v_ArrVal_609) |v_ULTIMATE.start_main_~p~0#1.base_45| v_ArrVal_613) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0))))) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (forall ((v_prenex_4 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_subst_3 Int) (v_prenex_3 (Array Int Int))) (or (= v_prenex_4 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_3 v_prenex_3) v_prenex_4 v_prenex_2) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)))) (= (select v_arrayElimArr_3 .cse0) 0)))) .cse2))) is different from false [2023-11-23 00:07:32,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:07:32,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 142 [2023-11-23 00:07:32,824 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (or (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select v_arrayElimArr_4 .cse0) 0) (forall ((v_prenex_4 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_subst_7 Int) (v_prenex_2 (Array Int Int)) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (= v_prenex_4 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_7 v_prenex_15) v_subst_3 v_prenex_3) v_prenex_4 v_prenex_2) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_prenex_15 4) 0))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select v_arrayElimArr_4 .cse0) 0) (forall ((v_ArrVal_613 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_subst_6 Int) (v_ArrVal_609 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (v_subst_4 Int) (v_prenex_17 (Array Int Int))) (or (not (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_6 v_prenex_17) v_subst_4 v_ArrVal_609) |v_ULTIMATE.start_main_~p~0#1.base_45| v_ArrVal_613) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= 0 (select v_prenex_17 4))))))) .cse2) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select v_arrayElimArr_4 .cse0) 0) (forall ((v_prenex_7 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_subst_8 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (or (= v_prenex_7 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (not (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_8 v_arrayElimArr_3) v_subst_1 v_prenex_6) v_prenex_7 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (= (select v_arrayElimArr_3 4) 0))))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_4 (Array Int Int)) (v_subst_5 Int) (v_prenex_10 Int) (v_subst_2 Int) (v_prenex_16 (Array Int Int))) (or (not (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_5 v_prenex_16) v_subst_2 v_prenex_9) v_prenex_10 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_arrayElimArr_4 .cse0) 0) (= (select v_prenex_16 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2))) .cse2))) is different from false [2023-11-23 00:07:33,015 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse3 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_5 Int) (v_prenex_10 Int) (v_subst_11 Int) (v_subst_2 Int) (v_prenex_16 (Array Int Int))) (or (not (= (select (select (store (store (store (store .cse0 v_subst_11 v_arrayElimArr_4) v_subst_5 v_prenex_16) v_subst_2 v_prenex_9) v_prenex_10 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_prenex_16 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_arrayElimArr_4 .cse2) 0))) .cse3) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select v_arrayElimArr_4 .cse2) 0) (forall ((v_prenex_7 Int) (v_subst_12 Int) (v_subst_8 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (or (= v_prenex_7 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_3 4) 0) (not (= (select (select (store (store (store (store .cse0 v_subst_12 v_arrayElimArr_4) v_subst_8 v_arrayElimArr_3) v_subst_1 v_prenex_6) v_prenex_7 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)))))) (or (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select v_arrayElimArr_4 .cse2) 0) (forall ((v_ArrVal_613 (Array Int Int)) (v_subst_9 Int) (v_subst_6 Int) (v_ArrVal_609 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (v_subst_4 Int) (v_prenex_17 (Array Int Int))) (or (not (= (select (select (store (store (store (store .cse0 v_subst_9 v_arrayElimArr_4) v_subst_6 v_prenex_17) v_subst_4 v_ArrVal_609) |v_ULTIMATE.start_main_~p~0#1.base_45| v_ArrVal_613) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= 0 (select v_prenex_17 4)))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_prenex_4 Int) (v_subst_7 Int) (v_prenex_2 (Array Int Int)) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_subst_10 Int) (v_prenex_15 (Array Int Int))) (or (= v_prenex_4 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store (store (store .cse0 v_subst_10 v_arrayElimArr_4) v_subst_7 v_prenex_15) v_subst_3 v_prenex_3) v_prenex_4 v_prenex_2) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_prenex_15 4) 0))) (= (select v_arrayElimArr_4 .cse2) 0)))) .cse3))) is different from false [2023-11-23 00:07:33,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:07:33,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 174 [2023-11-23 00:07:37,705 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse3 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (or (and (forall ((v_arrayElimArr_5 (Array Int Int))) (or (= (select v_arrayElimArr_5 .cse0) 0) (forall ((v_ArrVal_613 (Array Int Int)) (v_subst_9 Int) (v_subst_16 Int) (v_subst_6 Int) (v_ArrVal_609 (Array Int Int)) (v_prenex_24 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (v_subst_4 Int) (v_prenex_17 (Array Int Int))) (or (not (= (select (select (store (store (store (store (store .cse1 v_subst_16 v_arrayElimArr_5) v_subst_9 v_prenex_24) v_subst_6 v_prenex_17) v_subst_4 v_ArrVal_609) |v_ULTIMATE.start_main_~p~0#1.base_45| v_ArrVal_613) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_prenex_24 4) 0) (= 0 (select v_prenex_17 4)))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_subst_15 Int) (v_prenex_4 Int) (v_subst_7 Int) (v_prenex_2 (Array Int Int)) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_subst_10 Int) (v_prenex_15 (Array Int Int))) (or (= v_prenex_4 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select v_prenex_22 4) 0) (not (= (select (select (store (store (store (store (store .cse1 v_subst_15 v_arrayElimArr_5) v_subst_10 v_prenex_22) v_subst_7 v_prenex_15) v_subst_3 v_prenex_3) v_prenex_4 v_prenex_2) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_prenex_15 4) 0))) (= (select v_arrayElimArr_5 .cse0) 0)))) .cse3) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_prenex_7 Int) (v_subst_13 Int) (v_subst_12 Int) (v_arrayElimArr_4 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (or (= v_prenex_7 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store (store (store (store .cse1 v_subst_13 v_arrayElimArr_5) v_subst_12 v_arrayElimArr_4) v_subst_8 v_arrayElimArr_3) v_subst_1 v_prenex_6) v_prenex_7 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))) (= (select v_arrayElimArr_5 .cse0) 0))) (or (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_subst_14 Int) (v_subst_5 Int) (v_prenex_23 (Array Int Int)) (v_prenex_10 Int) (v_subst_11 Int) (v_subst_2 Int) (v_prenex_16 (Array Int Int))) (or (= (select v_prenex_16 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (not (= (select (select (store (store (store (store (store .cse1 v_subst_14 v_arrayElimArr_5) v_subst_11 v_prenex_23) v_subst_5 v_prenex_16) v_subst_2 v_prenex_9) v_prenex_10 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_arrayElimArr_5 .cse0) 0) (= (select v_prenex_23 4) 0))) .cse3))) is different from false [2023-11-23 00:07:37,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:07:37,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 217 treesize of output 206 [2023-11-23 00:07:37,913 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (or (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (= (select v_arrayElimArr_6 .cse0) 0) (forall ((v_subst_15 Int) (v_prenex_4 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_subst_7 Int) (v_prenex_2 (Array Int Int)) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_subst_10 Int) (v_prenex_15 (Array Int Int))) (or (= v_prenex_4 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select v_prenex_22 4) 0) (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_subst_15 v_prenex_29) v_subst_10 v_prenex_22) v_subst_7 v_prenex_15) v_subst_3 v_prenex_3) v_prenex_4 v_prenex_2) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_prenex_29 4) 0) (= (select v_prenex_15 4) 0))))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (= (select v_arrayElimArr_6 .cse0) 0) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_613 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_subst_9 Int) (v_subst_16 Int) (v_subst_6 Int) (v_ArrVal_609 (Array Int Int)) (v_prenex_24 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (v_subst_4 Int) (v_prenex_17 (Array Int Int))) (or (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_subst_16 v_arrayElimArr_5) v_subst_9 v_prenex_24) v_subst_6 v_prenex_17) v_subst_4 v_ArrVal_609) |v_ULTIMATE.start_main_~p~0#1.base_45| v_ArrVal_613) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_prenex_24 4) 0) (= 0 (select v_prenex_17 4))))))) .cse2) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (= (select v_arrayElimArr_6 .cse0) 0) (forall ((v_prenex_7 Int) (v_subst_13 Int) (v_subst_12 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_4 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_1 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (or (= v_prenex_7 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select v_prenex_30 4) 0) (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_subst_13 v_prenex_30) v_subst_12 v_arrayElimArr_4) v_subst_8 v_arrayElimArr_3) v_subst_1 v_prenex_6) v_prenex_7 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_14 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_subst_5 Int) (v_prenex_10 Int) (v_subst_11 Int) (v_subst_2 Int) (v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_16 (Array Int Int))) (or (= (select v_arrayElimArr_6 .cse0) 0) (= (select v_prenex_16 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_subst_14 v_prenex_31) v_subst_11 v_prenex_23) v_subst_5 v_prenex_16) v_subst_2 v_prenex_9) v_prenex_10 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_prenex_23 4) 0) (= (select v_prenex_31 4) 0))) .cse2))) is different from false [2023-11-23 00:07:44,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:07:44,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 238 [2023-11-23 00:07:46,876 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_subst_13 Int) (v_subst_12 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_subst_18 Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_subst_1 Int) (v_prenex_6 (Array Int Int)) (v_prenex_7 Int) (v_prenex_30 (Array Int Int)) (v_subst_8 Int) (v_prenex_37 (Array Int Int))) (or (= (select v_prenex_37 4) 0) (= v_prenex_7 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select v_prenex_30 4) 0) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) v_subst_18 v_prenex_37) v_subst_13 v_prenex_30) v_subst_12 v_arrayElimArr_4) v_subst_8 v_arrayElimArr_3) v_subst_1 v_prenex_6) v_prenex_7 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))) (= (select v_arrayElimArr_7 .cse1) 0))) (or (forall ((v_subst_14 Int) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_subst_17 Int) (v_subst_5 Int) (v_prenex_10 Int) (v_subst_2 Int) (v_subst_11 Int) (v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_prenex_38 (Array Int Int))) (or (= (select v_prenex_16 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) v_subst_17 v_prenex_38) v_subst_14 v_prenex_31) v_subst_11 v_prenex_23) v_subst_5 v_prenex_16) v_subst_2 v_prenex_9) v_prenex_10 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= (select v_prenex_38 4) 0) (= (select v_prenex_23 4) 0) (= (select v_prenex_31 4) 0) (= (select v_arrayElimArr_7 .cse1) 0))) .cse2) (or (and (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_subst_19 Int) (v_subst_16 Int) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_613 (Array Int Int)) (v_subst_9 Int) (v_prenex_36 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (v_prenex_24 (Array Int Int)) (v_prenex_17 (Array Int Int))) (or (= (select v_arrayElimArr_5 4) 0) (= (select v_prenex_36 4) 0) (= (select v_prenex_24 4) 0) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) v_subst_19 v_prenex_36) v_subst_16 v_arrayElimArr_5) v_subst_9 v_prenex_24) v_subst_6 v_prenex_17) v_subst_4 v_ArrVal_609) |v_ULTIMATE.start_main_~p~0#1.base_45| v_ArrVal_613) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= 0 (select v_prenex_17 4)))) (= (select v_arrayElimArr_7 .cse1) 0))) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_15 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_prenex_2 (Array Int Int)) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_subst_10 Int) (v_subst_20 Int) (v_prenex_4 Int) (v_subst_7 Int) (v_prenex_22 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (= (select v_arrayElimArr_6 4) 0) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) v_subst_20 v_arrayElimArr_6) v_subst_15 v_prenex_29) v_subst_10 v_prenex_22) v_subst_7 v_prenex_15) v_subst_3 v_prenex_3) v_prenex_4 v_prenex_2) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= v_prenex_4 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select v_prenex_22 4) 0) (= (select v_prenex_29 4) 0) (= (select v_prenex_15 4) 0))) (= (select v_arrayElimArr_7 .cse1) 0)))) .cse2))) is different from false [2023-11-23 00:07:47,212 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (or (forall ((v_subst_14 Int) (v_subst_24 Int) (v_arrayElimArr_7 (Array Int Int)) (v_subst_17 Int) (v_subst_5 Int) (v_prenex_10 Int) (v_subst_2 Int) (v_subst_11 Int) (v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_prenex_38 (Array Int Int))) (or (= (select v_prenex_16 4) 0) (= (select v_arrayElimArr_7 .cse0) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= (select v_prenex_38 4) 0) (= (select v_prenex_23 4) 0) (= (select v_prenex_31 4) 0) (not (= (select (select (store (store (store (store (store (store (store .cse1 v_subst_24 v_arrayElimArr_7) v_subst_17 v_prenex_38) v_subst_14 v_prenex_31) v_subst_11 v_prenex_23) v_subst_5 v_prenex_16) v_subst_2 v_prenex_9) v_prenex_10 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)))) .cse3) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (= (select v_arrayElimArr_7 .cse0) 0) (forall ((v_subst_13 Int) (v_subst_12 Int) (v_subst_23 Int) (v_subst_18 Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_subst_1 Int) (v_prenex_6 (Array Int Int)) (v_prenex_7 Int) (v_prenex_30 (Array Int Int)) (v_subst_8 Int) (v_prenex_37 (Array Int Int))) (or (= (select v_prenex_37 4) 0) (= v_prenex_7 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select v_prenex_30 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (not (= (select (select (store (store (store (store (store (store (store .cse1 v_subst_23 v_arrayElimArr_7) v_subst_18 v_prenex_37) v_subst_13 v_prenex_30) v_subst_12 v_arrayElimArr_4) v_subst_8 v_arrayElimArr_3) v_subst_1 v_prenex_6) v_prenex_7 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))))) (or (and (forall ((v_arrayElimArr_7 (Array Int Int))) (or (= (select v_arrayElimArr_7 .cse0) 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_15 Int) (v_prenex_2 (Array Int Int)) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_subst_21 Int) (v_subst_10 Int) (v_subst_20 Int) (v_prenex_4 Int) (v_subst_7 Int) (v_prenex_22 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (= (select v_arrayElimArr_6 4) 0) (= v_prenex_4 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store (store (store (store (store (store .cse1 v_subst_21 v_arrayElimArr_7) v_subst_20 v_arrayElimArr_6) v_subst_15 v_prenex_29) v_subst_10 v_prenex_22) v_subst_7 v_prenex_15) v_subst_3 v_prenex_3) v_prenex_4 v_prenex_2) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_prenex_22 4) 0) (= (select v_prenex_29 4) 0) (= (select v_prenex_15 4) 0))))) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (= (select v_arrayElimArr_7 .cse0) 0) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_subst_19 Int) (v_subst_16 Int) (v_subst_6 Int) (v_subst_4 Int) (v_subst_22 Int) (v_ArrVal_613 (Array Int Int)) (v_subst_9 Int) (v_prenex_36 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (v_prenex_24 (Array Int Int)) (v_prenex_17 (Array Int Int))) (or (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store .cse1 v_subst_22 v_arrayElimArr_7) v_subst_19 v_prenex_36) v_subst_16 v_arrayElimArr_5) v_subst_9 v_prenex_24) v_subst_6 v_prenex_17) v_subst_4 v_ArrVal_609) |v_ULTIMATE.start_main_~p~0#1.base_45| v_ArrVal_613) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_prenex_36 4) 0) (= (select v_prenex_24 4) 0) (= 0 (select v_prenex_17 4))))))) .cse3))) is different from false [2023-11-23 00:07:47,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:07:47,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 281 treesize of output 270 [2023-11-23 00:07:50,651 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse2 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (forall ((v_subst_14 Int) (v_arrayElimArr_8 (Array Int Int)) (v_subst_24 Int) (v_arrayElimArr_7 (Array Int Int)) (v_subst_28 Int) (v_subst_17 Int) (v_subst_5 Int) (v_prenex_10 Int) (v_subst_2 Int) (v_ArrVal_575 (Array Int Int)) (v_subst_11 Int) (v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_prenex_38 (Array Int Int))) (or (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_575) v_subst_28 v_arrayElimArr_8) v_subst_24 v_arrayElimArr_7) v_subst_17 v_prenex_38) v_subst_14 v_prenex_31) v_subst_11 v_prenex_23) v_subst_5 v_prenex_16) v_subst_2 v_prenex_9) v_prenex_10 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_prenex_16 4) 0) (= (select v_arrayElimArr_8 .cse2) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= 0 (select v_arrayElimArr_7 4)) (= (select v_prenex_38 4) 0) (= (select v_prenex_23 4) 0) (= (select v_prenex_31 4) 0)))) (or (and (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_575 (Array Int Int))) (or (= (select v_arrayElimArr_8 .cse2) 0) (forall ((v_subst_26 Int) (v_arrayElimArr_5 (Array Int Int)) (v_subst_19 Int) (v_subst_16 Int) (v_subst_6 Int) (v_subst_4 Int) (v_subst_22 Int) (v_ArrVal_613 (Array Int Int)) (v_subst_9 Int) (v_prenex_36 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (v_prenex_24 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_17 (Array Int Int))) (or (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_575) v_subst_26 v_arrayElimArr_8) v_subst_22 v_prenex_45) v_subst_19 v_prenex_36) v_subst_16 v_arrayElimArr_5) v_subst_9 v_prenex_24) v_subst_6 v_prenex_17) v_subst_4 v_ArrVal_609) |v_ULTIMATE.start_main_~p~0#1.base_45| v_ArrVal_613) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_prenex_45 4) 0) (= (select v_prenex_36 4) 0) (= (select v_prenex_24 4) 0) (= 0 (select v_prenex_17 4)))))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_575 (Array Int Int))) (or (= (select v_arrayElimArr_8 .cse2) 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_15 Int) (v_subst_25 Int) (v_prenex_2 (Array Int Int)) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_subst_10 Int) (v_subst_21 Int) (v_subst_20 Int) (v_prenex_4 Int) (v_prenex_43 (Array Int Int)) (v_subst_7 Int) (v_prenex_22 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (= (select v_arrayElimArr_6 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_575) v_subst_25 v_arrayElimArr_8) v_subst_21 v_prenex_43) v_subst_20 v_arrayElimArr_6) v_subst_15 v_prenex_29) v_subst_10 v_prenex_22) v_subst_7 v_prenex_15) v_subst_3 v_prenex_3) v_prenex_4 v_prenex_2) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= v_prenex_4 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select v_prenex_22 4) 0) (= (select v_prenex_29 4) 0) (= (select v_prenex_43 4) 0) (= (select v_prenex_15 4) 0)))))) .cse0) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_575 (Array Int Int))) (or (= (select v_arrayElimArr_8 .cse2) 0) (forall ((v_subst_13 Int) (v_subst_12 Int) (v_subst_23 Int) (v_subst_18 Int) (v_arrayElimArr_4 (Array Int Int)) (v_subst_27 Int) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_subst_1 Int) (v_prenex_6 (Array Int Int)) (v_prenex_7 Int) (v_prenex_30 (Array Int Int)) (v_subst_8 Int) (v_prenex_44 (Array Int Int)) (v_prenex_37 (Array Int Int))) (or (= (select v_prenex_37 4) 0) (= v_prenex_7 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_575) v_subst_27 v_arrayElimArr_8) v_subst_23 v_prenex_44) v_subst_18 v_prenex_37) v_subst_13 v_prenex_30) v_subst_12 v_arrayElimArr_4) v_subst_8 v_arrayElimArr_3) v_subst_1 v_prenex_6) v_prenex_7 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= (select v_prenex_44 4) 0) (= (select v_prenex_30 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))))))) is different from false [2023-11-23 00:07:50,905 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_575 (Array Int Int))) (or (= (select v_arrayElimArr_8 4) 0) (forall ((v_subst_13 Int) (v_subst_12 Int) (v_subst_23 Int) (v_subst_18 Int) (v_arrayElimArr_4 (Array Int Int)) (v_subst_27 Int) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_subst_1 Int) (v_prenex_6 (Array Int Int)) (v_prenex_7 Int) (v_prenex_30 (Array Int Int)) (v_subst_8 Int) (v_prenex_44 (Array Int Int)) (v_prenex_37 (Array Int Int))) (or (= (select v_prenex_37 4) 0) (= v_prenex_7 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_575) v_subst_27 v_arrayElimArr_8) v_subst_23 v_prenex_44) v_subst_18 v_prenex_37) v_subst_13 v_prenex_30) v_subst_12 v_arrayElimArr_4) v_subst_8 v_arrayElimArr_3) v_subst_1 v_prenex_6) v_prenex_7 v_prenex_5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= (select v_prenex_44 4) 0) (= (select v_prenex_30 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))))) (or (and (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_575 (Array Int Int))) (or (= (select v_arrayElimArr_8 4) 0) (forall ((v_subst_26 Int) (v_arrayElimArr_5 (Array Int Int)) (v_subst_19 Int) (v_subst_16 Int) (v_subst_6 Int) (v_subst_4 Int) (v_subst_22 Int) (v_ArrVal_613 (Array Int Int)) (v_subst_9 Int) (v_prenex_36 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (v_prenex_24 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_17 (Array Int Int))) (or (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_575) v_subst_26 v_arrayElimArr_8) v_subst_22 v_prenex_45) v_subst_19 v_prenex_36) v_subst_16 v_arrayElimArr_5) v_subst_9 v_prenex_24) v_subst_6 v_prenex_17) v_subst_4 v_ArrVal_609) |v_ULTIMATE.start_main_~p~0#1.base_45| v_ArrVal_613) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= (select v_prenex_45 4) 0) (= (select v_prenex_36 4) 0) (= (select v_prenex_24 4) 0) (= 0 (select v_prenex_17 4)))))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_575 (Array Int Int))) (or (= (select v_arrayElimArr_8 4) 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_15 Int) (v_subst_25 Int) (v_prenex_2 (Array Int Int)) (v_subst_3 Int) (v_prenex_3 (Array Int Int)) (v_subst_10 Int) (v_subst_21 Int) (v_subst_20 Int) (v_prenex_4 Int) (v_prenex_43 (Array Int Int)) (v_subst_7 Int) (v_prenex_22 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (= (select v_arrayElimArr_6 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_575) v_subst_25 v_arrayElimArr_8) v_subst_21 v_prenex_43) v_subst_20 v_arrayElimArr_6) v_subst_15 v_prenex_29) v_subst_10 v_prenex_22) v_subst_7 v_prenex_15) v_subst_3 v_prenex_3) v_prenex_4 v_prenex_2) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= v_prenex_4 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select v_prenex_22 4) 0) (= (select v_prenex_29 4) 0) (= (select v_prenex_43 4) 0) (= (select v_prenex_15 4) 0)))))) .cse1) (or .cse1 (forall ((v_subst_14 Int) (v_arrayElimArr_8 (Array Int Int)) (v_subst_24 Int) (v_arrayElimArr_7 (Array Int Int)) (v_subst_28 Int) (v_subst_17 Int) (v_subst_5 Int) (v_prenex_10 Int) (v_subst_2 Int) (v_ArrVal_575 (Array Int Int)) (v_subst_11 Int) (v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_prenex_38 (Array Int Int))) (or (= (select v_arrayElimArr_8 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_575) v_subst_28 v_arrayElimArr_8) v_subst_24 v_arrayElimArr_7) v_subst_17 v_prenex_38) v_subst_14 v_prenex_31) v_subst_11 v_prenex_23) v_subst_5 v_prenex_16) v_subst_2 v_prenex_9) v_prenex_10 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)) (= (select v_prenex_16 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_2) (= 0 (select v_arrayElimArr_7 4)) (= (select v_prenex_38 4) 0) (= (select v_prenex_23 4) 0) (= (select v_prenex_31 4) 0)))))) is different from false [2023-11-23 00:08:04,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:08:04,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 325 treesize of output 470 [2023-11-23 00:08:04,323 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-23 00:08:04,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 102 [2023-11-23 00:08:04,447 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-23 00:08:04,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 102 [2023-11-23 00:08:04,834 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-23 00:08:04,834 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 2 case distinctions, treesize of input 35 treesize of output 8 [2023-11-23 00:08:05,174 INFO L349 Elim1Store]: treesize reduction 111, result has 6.7 percent of original size [2023-11-23 00:08:05,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 107 treesize of output 89 [2023-11-23 00:08:06,251 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-11-23 00:08:06,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 40 [2023-11-23 00:08:11,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:08:11,293 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 54 treesize of output 55 [2023-11-23 00:08:11,297 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 00:08:11,297 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 00:08:11,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:08:11,461 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 76578817 treesize of output 76480518 [2023-11-23 00:08:12,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:08:12,051 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 4856 treesize of output 4350 [2023-11-23 00:08:12,106 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 4338 treesize of output 4330 [2023-11-23 00:08:12,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:08:12,172 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 4336 treesize of output 4278 [2023-11-23 00:08:12,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:08:12,234 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 4277 treesize of output 4021 [2023-11-23 00:08:12,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:08:12,308 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 4012 treesize of output 3890 [2023-11-23 00:08:12,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:08:12,382 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 3884 treesize of output 3634 [2023-11-23 00:08:12,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:08:12,451 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 3628 treesize of output 3602 [2023-11-23 00:08:12,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:08:12,518 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 3596 treesize of output 3586 [2023-11-23 00:08:14,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:08:14,302 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 54 treesize of output 55 [2023-11-23 00:08:14,305 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 00:08:14,306 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 00:08:14,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:08:14,372 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 4720641 treesize of output 4714502 [2023-11-23 00:08:14,951 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 4594 treesize of output 4082 [2023-11-23 00:08:15,077 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 00:08:15,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 4088 treesize of output 4070 [2023-11-23 00:08:15,222 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 00:08:15,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 4072 treesize of output 4038 [2023-11-23 00:08:15,340 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 00:08:15,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 4040 treesize of output 4030 [2023-11-23 00:08:15,447 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 00:08:15,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 4032 treesize of output 3902 [2023-11-23 00:08:15,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:08:15,555 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 3926 treesize of output 3922 [2023-11-23 00:08:15,624 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 00:08:15,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3900 treesize of output 3642 [2023-11-23 00:08:15,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 00:08:15,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3644 treesize of output 3578 [2023-11-23 00:08:15,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 00:08:15,992 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 54 treesize of output 55 [2023-11-23 00:08:15,995 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 00:08:40,083 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-23 00:08:40,105 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 00:08:40,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 00:08:40,285 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 235693 column 7: push canceled at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 235693 column 7: push canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1511) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:230) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 55 more [2023-11-23 00:08:40,291 INFO L158 Benchmark]: Toolchain (without parser) took 93066.67ms. Allocated memory was 159.4MB in the beginning and 13.9GB in the end (delta: 13.7GB). Free memory was 85.8MB in the beginning and 12.7GB in the end (delta: -12.6GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2023-11-23 00:08:40,291 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 109.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 00:08:40,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.96ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 68.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-23 00:08:40,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.78ms. Allocated memory is still 159.4MB. Free memory was 68.8MB in the beginning and 67.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 00:08:40,292 INFO L158 Benchmark]: Boogie Preprocessor took 29.24ms. Allocated memory is still 159.4MB. Free memory was 67.0MB in the beginning and 65.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 00:08:40,292 INFO L158 Benchmark]: RCFGBuilder took 379.71ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 65.4MB in the beginning and 177.5MB in the end (delta: -112.2MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2023-11-23 00:08:40,292 INFO L158 Benchmark]: TraceAbstraction took 92262.34ms. Allocated memory was 211.8MB in the beginning and 13.9GB in the end (delta: 13.7GB). Free memory was 176.5MB in the beginning and 12.7GB in the end (delta: -12.5GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2023-11-23 00:08:40,293 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 109.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.96ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 68.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.78ms. Allocated memory is still 159.4MB. Free memory was 68.8MB in the beginning and 67.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.24ms. Allocated memory is still 159.4MB. Free memory was 67.0MB in the beginning and 65.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 379.71ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 65.4MB in the beginning and 177.5MB in the end (delta: -112.2MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * TraceAbstraction took 92262.34ms. Allocated memory was 211.8MB in the beginning and 13.9GB in the end (delta: 13.7GB). Free memory was 176.5MB in the beginning and 12.7GB in the end (delta: -12.5GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 235693 column 7: push canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 235693 column 7: push canceled: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-23 00:08:40,506 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-11-23 00:08:40,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-ext2-properties/simple_search_value-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 9339a3186df1139a7984a9803a310ef99d020bdafafac2d122ebd6ff2b132483 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-23 00:08:42,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 00:08:42,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-23 00:08:42,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 00:08:42,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 00:08:42,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 00:08:42,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 00:08:42,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 00:08:42,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 00:08:42,541 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 00:08:42,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 00:08:42,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 00:08:42,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 00:08:42,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 00:08:42,542 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 00:08:42,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 00:08:42,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 00:08:42,543 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 00:08:42,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 00:08:42,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 00:08:42,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 00:08:42,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 00:08:42,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 00:08:42,545 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 00:08:42,545 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 00:08:42,545 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 00:08:42,545 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 00:08:42,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 00:08:42,546 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 00:08:42,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 00:08:42,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 00:08:42,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 00:08:42,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 00:08:42,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 00:08:42,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 00:08:42,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 00:08:42,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 00:08:42,548 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 00:08:42,548 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 00:08:42,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 00:08:42,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 00:08:42,549 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 00:08:42,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 00:08:42,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 00:08:42,549 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 00:08:42,549 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 -> 9339a3186df1139a7984a9803a310ef99d020bdafafac2d122ebd6ff2b132483 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 00:08:42,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 00:08:42,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 00:08:42,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 00:08:42,874 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 00:08:42,874 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 00:08:42,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i [2023-11-23 00:08:43,978 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 00:08:44,146 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 00:08:44,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i [2023-11-23 00:08:44,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8799acce7/2719261bae144b129645c0d441038efd/FLAGcdb2dea86 [2023-11-23 00:08:44,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8799acce7/2719261bae144b129645c0d441038efd [2023-11-23 00:08:44,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 00:08:44,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 00:08:44,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 00:08:44,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 00:08:44,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 00:08:44,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:08:44" (1/1) ... [2023-11-23 00:08:44,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@351d401b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:44, skipping insertion in model container [2023-11-23 00:08:44,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:08:44" (1/1) ... [2023-11-23 00:08:44,229 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 00:08:44,482 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-ext2-properties/simple_search_value-1.i[23210,23223] [2023-11-23 00:08:44,486 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 00:08:44,499 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 00:08:44,543 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-ext2-properties/simple_search_value-1.i[23210,23223] [2023-11-23 00:08:44,548 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 00:08:44,610 INFO L206 MainTranslator]: Completed translation [2023-11-23 00:08:44,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:44 WrapperNode [2023-11-23 00:08:44,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 00:08:44,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 00:08:44,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 00:08:44,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 00:08:44,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:44" (1/1) ... [2023-11-23 00:08:44,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:44" (1/1) ... [2023-11-23 00:08:44,662 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2023-11-23 00:08:44,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 00:08:44,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 00:08:44,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 00:08:44,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 00:08:44,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:44" (1/1) ... [2023-11-23 00:08:44,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:44" (1/1) ... [2023-11-23 00:08:44,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:44" (1/1) ... [2023-11-23 00:08:44,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:44" (1/1) ... [2023-11-23 00:08:44,694 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:44" (1/1) ... [2023-11-23 00:08:44,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:44" (1/1) ... [2023-11-23 00:08:44,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:44" (1/1) ... [2023-11-23 00:08:44,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:44" (1/1) ... [2023-11-23 00:08:44,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 00:08:44,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 00:08:44,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 00:08:44,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 00:08:44,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:44" (1/1) ... [2023-11-23 00:08:44,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 00:08:44,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 00:08:44,786 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 00:08:44,823 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 00:08:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-23 00:08:44,860 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-23 00:08:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-23 00:08:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 00:08:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 00:08:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 00:08:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 00:08:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-23 00:08:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-23 00:08:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 00:08:44,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 00:08:44,954 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 00:08:44,956 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 00:08:45,023 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-23 00:08:45,161 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 00:08:45,186 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 00:08:45,186 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 00:08:45,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:08:45 BoogieIcfgContainer [2023-11-23 00:08:45,186 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 00:08:45,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 00:08:45,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 00:08:45,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 00:08:45,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:08:44" (1/3) ... [2023-11-23 00:08:45,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758ae2c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:08:45, skipping insertion in model container [2023-11-23 00:08:45,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:44" (2/3) ... [2023-11-23 00:08:45,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758ae2c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:08:45, skipping insertion in model container [2023-11-23 00:08:45,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:08:45" (3/3) ... [2023-11-23 00:08:45,192 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_search_value-1.i [2023-11-23 00:08:45,207 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 00:08:45,207 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 00:08:45,246 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 00:08:45,251 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;@191530d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 00:08:45,251 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 00:08:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 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 00:08:45,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-23 00:08:45,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:08:45,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:08:45,260 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:08:45,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:08:45,265 INFO L85 PathProgramCache]: Analyzing trace with hash 357278617, now seen corresponding path program 1 times [2023-11-23 00:08:45,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 00:08:45,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445441660] [2023-11-23 00:08:45,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:08:45,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 00:08:45,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 00:08:45,278 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 00:08:45,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-23 00:08:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:08:45,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 00:08:45,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 00:08:45,390 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 00:08:45,390 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 00:08:45,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 00:08:45,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445441660] [2023-11-23 00:08:45,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445441660] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:08:45,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:08:45,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 00:08:45,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890886464] [2023-11-23 00:08:45,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:08:45,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 00:08:45,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 00:08:45,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 00:08:45,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 00:08:45,443 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 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 00:08:45,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:08:45,465 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2023-11-23 00:08:45,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 00:08:45,467 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 00:08:45,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:08:45,472 INFO L225 Difference]: With dead ends: 34 [2023-11-23 00:08:45,473 INFO L226 Difference]: Without dead ends: 17 [2023-11-23 00:08:45,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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 00:08:45,479 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 00:08:45,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 00:08:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-23 00:08:45,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-11-23 00:08:45,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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 00:08:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-11-23 00:08:45,507 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 8 [2023-11-23 00:08:45,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:08:45,507 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-23 00:08:45,508 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 00:08:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-11-23 00:08:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-23 00:08:45,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:08:45,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:08:45,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-23 00:08:45,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 00:08:45,714 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:08:45,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:08:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1991764778, now seen corresponding path program 1 times [2023-11-23 00:08:45,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 00:08:45,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705718582] [2023-11-23 00:08:45,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:08:45,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 00:08:45,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 00:08:45,719 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 00:08:45,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-23 00:08:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:08:45,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 00:08:45,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 00:08:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:08:45,847 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 00:08:45,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 00:08:45,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705718582] [2023-11-23 00:08:45,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705718582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:08:45,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:08:45,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 00:08:45,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606862877] [2023-11-23 00:08:45,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:08:45,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 00:08:45,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 00:08:45,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 00:08:45,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 00:08:45,849 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 00:08:45,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:08:45,895 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2023-11-23 00:08:45,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 00:08:45,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2023-11-23 00:08:45,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:08:45,897 INFO L225 Difference]: With dead ends: 37 [2023-11-23 00:08:45,897 INFO L226 Difference]: Without dead ends: 23 [2023-11-23 00:08:45,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 00:08:45,898 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 00:08:45,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 45 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 00:08:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-23 00:08:45,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-11-23 00:08:45,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 00:08:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-11-23 00:08:45,902 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2023-11-23 00:08:45,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:08:45,902 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-23 00:08:45,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 00:08:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-23 00:08:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 00:08:45,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:08:45,902 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:08:45,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-23 00:08:46,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 00:08:46,106 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:08:46,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:08:46,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1438995548, now seen corresponding path program 1 times [2023-11-23 00:08:46,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 00:08:46,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606660746] [2023-11-23 00:08:46,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:08:46,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 00:08:46,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 00:08:46,108 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 00:08:46,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-23 00:08:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:08:46,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 00:08:46,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 00:08:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:08:46,232 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 00:08:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 00:08:46,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 00:08:46,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606660746] [2023-11-23 00:08:46,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606660746] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 00:08:46,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 00:08:46,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-11-23 00:08:46,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629950208] [2023-11-23 00:08:46,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 00:08:46,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 00:08:46,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 00:08:46,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 00:08:46,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-23 00:08:46,267 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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 00:08:46,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:08:46,477 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2023-11-23 00:08:46,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 00:08:46,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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) Word has length 15 [2023-11-23 00:08:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:08:46,480 INFO L225 Difference]: With dead ends: 53 [2023-11-23 00:08:46,480 INFO L226 Difference]: Without dead ends: 38 [2023-11-23 00:08:46,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2023-11-23 00:08:46,482 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 00:08:46,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 63 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 00:08:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-23 00:08:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2023-11-23 00:08:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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 00:08:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-11-23 00:08:46,487 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 15 [2023-11-23 00:08:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:08:46,487 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-11-23 00:08:46,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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 00:08:46,487 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-11-23 00:08:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-23 00:08:46,491 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:08:46,491 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:08:46,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-23 00:08:46,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 00:08:46,702 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:08:46,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:08:46,705 INFO L85 PathProgramCache]: Analyzing trace with hash -813781656, now seen corresponding path program 2 times [2023-11-23 00:08:46,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 00:08:46,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703731993] [2023-11-23 00:08:46,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 00:08:46,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 00:08:46,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 00:08:46,718 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 00:08:46,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-23 00:08:46,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-23 00:08:46,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 00:08:46,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 00:08:46,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 00:08:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-23 00:08:46,868 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 00:08:46,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 00:08:46,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703731993] [2023-11-23 00:08:46,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703731993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 00:08:46,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 00:08:46,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 00:08:46,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198362154] [2023-11-23 00:08:46,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 00:08:46,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 00:08:46,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 00:08:46,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 00:08:46,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 00:08:46,871 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 00:08:46,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:08:46,922 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2023-11-23 00:08:46,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 00:08:46,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 30 [2023-11-23 00:08:46,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:08:46,924 INFO L225 Difference]: With dead ends: 43 [2023-11-23 00:08:46,924 INFO L226 Difference]: Without dead ends: 40 [2023-11-23 00:08:46,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 00:08:46,925 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 00:08:46,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 23 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 00:08:46,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-23 00:08:46,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2023-11-23 00:08:46,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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 00:08:46,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-11-23 00:08:46,929 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 30 [2023-11-23 00:08:46,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:08:46,929 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-11-23 00:08:46,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 00:08:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-11-23 00:08:46,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-23 00:08:46,930 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:08:46,930 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:08:46,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-23 00:08:47,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 00:08:47,134 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:08:47,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:08:47,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1302450726, now seen corresponding path program 1 times [2023-11-23 00:08:47,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 00:08:47,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307852850] [2023-11-23 00:08:47,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 00:08:47,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 00:08:47,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 00:08:47,136 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 00:08:47,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-23 00:08:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 00:08:47,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 00:08:47,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 00:08:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 00:08:47,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 00:08:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 00:08:47,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 00:08:47,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307852850] [2023-11-23 00:08:47,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307852850] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 00:08:47,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 00:08:47,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-11-23 00:08:47,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655386183] [2023-11-23 00:08:47,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 00:08:47,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 00:08:47,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 00:08:47,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 00:08:47,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-23 00:08:47,447 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 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 00:08:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 00:08:48,189 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2023-11-23 00:08:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-23 00:08:48,193 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 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 35 [2023-11-23 00:08:48,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 00:08:48,193 INFO L225 Difference]: With dead ends: 85 [2023-11-23 00:08:48,193 INFO L226 Difference]: Without dead ends: 69 [2023-11-23 00:08:48,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=466, Unknown=0, NotChecked=0, Total=702 [2023-11-23 00:08:48,195 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 00:08:48,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 155 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 00:08:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-23 00:08:48,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2023-11-23 00:08:48,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 00:08:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2023-11-23 00:08:48,203 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 35 [2023-11-23 00:08:48,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 00:08:48,203 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2023-11-23 00:08:48,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 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 00:08:48,203 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2023-11-23 00:08:48,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 00:08:48,205 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 00:08:48,206 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 00:08:48,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-23 00:08:48,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 00:08:48,411 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 00:08:48,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 00:08:48,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2036934490, now seen corresponding path program 2 times [2023-11-23 00:08:48,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 00:08:48,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506518561] [2023-11-23 00:08:48,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 00:08:48,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 00:08:48,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 00:08:48,413 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 00:08:48,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-23 00:08:49,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 00:08:49,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 00:08:49,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-23 00:08:49,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 00:08:49,106 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 7 [2023-11-23 00:08:49,231 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 00:08:49,267 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-23 00:08:49,267 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 27 [2023-11-23 00:08:49,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-23 00:08:49,477 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-23 00:08:49,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-23 00:08:49,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 00:08:49,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 00:08:49,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 00:08:49,804 INFO L349 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-11-23 00:08:49,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-11-23 00:08:49,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 00:08:50,128 INFO L349 Elim1Store]: treesize reduction 72, result has 32.1 percent of original size [2023-11-23 00:08:50,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 52 [2023-11-23 00:08:50,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 00:08:50,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 00:08:50,622 INFO L349 Elim1Store]: treesize reduction 72, result has 32.1 percent of original size [2023-11-23 00:08:50,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 52 [2023-11-23 00:08:50,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 00:08:50,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 00:08:51,159 INFO L349 Elim1Store]: treesize reduction 72, result has 32.1 percent of original size [2023-11-23 00:08:51,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 52 [2023-11-23 00:08:51,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 00:08:51,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 00:08:51,624 INFO L349 Elim1Store]: treesize reduction 48, result has 31.4 percent of original size [2023-11-23 00:08:51,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 44 [2023-11-23 00:08:51,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 00:08:51,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 00:08:52,046 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-23 00:08:52,046 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 22 [2023-11-23 00:08:52,120 INFO L349 Elim1Store]: treesize reduction 94, result has 23.6 percent of original size [2023-11-23 00:08:52,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 35 treesize of output 56 [2023-11-23 00:08:52,329 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 00:08:52,329 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 34 treesize of output 25 [2023-11-23 00:08:52,645 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-11-23 00:08:52,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 56 [2023-11-23 00:08:52,769 INFO L349 Elim1Store]: treesize reduction 54, result has 55.4 percent of original size [2023-11-23 00:08:52,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 52 treesize of output 106 [2023-11-23 00:08:53,283 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 00:08:53,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2023-11-23 00:08:53,486 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2023-11-23 00:08:53,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 68 [2023-11-23 00:08:53,943 INFO L349 Elim1Store]: treesize reduction 80, result has 51.5 percent of original size [2023-11-23 00:08:53,943 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 14 case distinctions, treesize of input 81 treesize of output 144 [2023-11-23 00:09:05,460 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification. DAG size of input: 1597 DAG size of output: 238 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-23 00:09:05,460 INFO L349 Elim1Store]: treesize reduction 3120, result has 12.4 percent of original size [2023-11-23 00:09:05,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 27 select indices, 27 select index equivalence classes, 0 disjoint index pairs (out of 351 index pairs), introduced 27 new quantified variables, introduced 377 case distinctions, treesize of input 300 treesize of output 647 [2023-11-23 00:10:01,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:01,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 00:10:01,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 1 [2023-11-23 00:10:01,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-23 00:10:01,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 00:10:01,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 1 [2023-11-23 00:10:02,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 00:10:02,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 1 [2023-11-23 00:10:02,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 00:10:02,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 1 [2023-11-23 00:10:02,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-23 00:10:02,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 00:10:02,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 1 [2023-11-23 00:10:02,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-23 00:10:02,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-23 00:10:02,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-23 00:10:02,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 00:10:02,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 1 [2023-11-23 00:10:02,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 00:10:02,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 1 [2023-11-23 00:10:02,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-23 00:10:02,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-23 00:10:03,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-23 00:10:03,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-23 00:10:03,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-23 00:10:03,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 00:10:03,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 1 [2023-11-23 00:10:03,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:03,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-23 00:10:03,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 00:10:03,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 1 [2023-11-23 00:10:03,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 00:10:03,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 1 [2023-11-23 00:10:03,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 00:10:03,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 1 [2023-11-23 00:10:13,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:13,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:13,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:13,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:13,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:13,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:13,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:13,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:13,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:13,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:14,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:14,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:14,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:14,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:14,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:14,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:14,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:14,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:14,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:15,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:15,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-23 00:10:15,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 00:10:15,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-23 00:10:29,651 WARN L293 SmtUtils]: Spent 8.52s on a formula simplification. DAG size of input: 669 DAG size of output: 479 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15