./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/list-properties/list-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 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 13:05:56,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 13:05:56,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 13:05:56,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 13:05:56,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 13:05:56,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 13:05:56,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 13:05:56,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 13:05:56,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 13:05:56,791 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 13:05:56,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 13:05:56,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 13:05:56,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 13:05:56,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 13:05:56,793 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 13:05:56,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 13:05:56,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 13:05:56,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 13:05:56,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 13:05:56,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 13:05:56,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 13:05:56,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 13:05:56,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 13:05:56,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 13:05:56,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 13:05:56,799 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 13:05:56,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 13:05:56,799 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 13:05:56,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 13:05:56,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 13:05:56,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 13:05:56,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 13:05:56,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:05:56,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 13:05:56,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 13:05:56,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 13:05:56,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 13:05:56,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 13:05:56,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 13:05:56,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 13:05:56,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 13:05:56,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 13:05:56,803 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 -> 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 [2024-11-18 13:05:57,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 13:05:57,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 13:05:57,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 13:05:57,056 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 13:05:57,057 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 13:05:57,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-1.i [2024-11-18 13:05:58,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 13:05:58,599 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 13:05:58,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i [2024-11-18 13:05:58,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a5bb7e60/725d0bc0a07c4067b6c3e7e13b8e68de/FLAG32091a2c8 [2024-11-18 13:05:58,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a5bb7e60/725d0bc0a07c4067b6c3e7e13b8e68de [2024-11-18 13:05:58,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 13:05:58,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 13:05:58,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 13:05:58,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 13:05:58,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 13:05:58,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:05:58" (1/1) ... [2024-11-18 13:05:58,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c27adea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:58, skipping insertion in model container [2024-11-18 13:05:58,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:05:58" (1/1) ... [2024-11-18 13:05:58,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 13:05:58,947 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i[23408,23421] [2024-11-18 13:05:58,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:05:58,959 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 13:05:58,987 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i[23408,23421] [2024-11-18 13:05:58,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:05:59,011 INFO L204 MainTranslator]: Completed translation [2024-11-18 13:05:59,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:59 WrapperNode [2024-11-18 13:05:59,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 13:05:59,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 13:05:59,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 13:05:59,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 13:05:59,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:59" (1/1) ... [2024-11-18 13:05:59,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:59" (1/1) ... [2024-11-18 13:05:59,110 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2024-11-18 13:05:59,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 13:05:59,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 13:05:59,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 13:05:59,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 13:05:59,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:59" (1/1) ... [2024-11-18 13:05:59,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:59" (1/1) ... [2024-11-18 13:05:59,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:59" (1/1) ... [2024-11-18 13:05:59,189 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-18 13:05:59,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:59" (1/1) ... [2024-11-18 13:05:59,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:59" (1/1) ... [2024-11-18 13:05:59,197 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:59" (1/1) ... [2024-11-18 13:05:59,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:59" (1/1) ... [2024-11-18 13:05:59,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:59" (1/1) ... [2024-11-18 13:05:59,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:59" (1/1) ... [2024-11-18 13:05:59,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 13:05:59,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 13:05:59,210 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 13:05:59,210 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 13:05:59,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:59" (1/1) ... [2024-11-18 13:05:59,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:05:59,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:05:59,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 13:05:59,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 13:05:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-18 13:05:59,301 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-18 13:05:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 13:05:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 13:05:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 13:05:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 13:05:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-18 13:05:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 13:05:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 13:05:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 13:05:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 13:05:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 13:05:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 13:05:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 13:05:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 13:05:59,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 13:05:59,420 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 13:05:59,423 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 13:05:59,442 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-18 13:05:59,542 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-18 13:05:59,543 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 13:05:59,555 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 13:05:59,555 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-18 13:05:59,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:05:59 BoogieIcfgContainer [2024-11-18 13:05:59,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 13:05:59,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 13:05:59,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 13:05:59,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 13:05:59,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:05:58" (1/3) ... [2024-11-18 13:05:59,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfe7c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:05:59, skipping insertion in model container [2024-11-18 13:05:59,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:05:59" (2/3) ... [2024-11-18 13:05:59,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfe7c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:05:59, skipping insertion in model container [2024-11-18 13:05:59,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:05:59" (3/3) ... [2024-11-18 13:05:59,561 INFO L112 eAbstractionObserver]: Analyzing ICFG list-1.i [2024-11-18 13:05:59,573 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 13:05:59,574 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 13:05:59,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 13:05:59,619 INFO L333 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, 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;@68101910, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 13:05:59,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 13:05:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:05:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-18 13:05:59,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:05:59,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:05:59,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:05:59,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:05:59,636 INFO L85 PathProgramCache]: Analyzing trace with hash 896526153, now seen corresponding path program 1 times [2024-11-18 13:05:59,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:05:59,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53509376] [2024-11-18 13:05:59,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:05:59,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:05:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:05:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:05:59,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:05:59,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53509376] [2024-11-18 13:05:59,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53509376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:05:59,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:05:59,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 13:05:59,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157723961] [2024-11-18 13:05:59,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:05:59,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 13:05:59,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:05:59,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 13:05:59,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:05:59,812 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2024-11-18 13:05:59,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:05:59,831 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2024-11-18 13:05:59,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 13:05:59,833 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2024-11-18 13:05:59,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:05:59,837 INFO L225 Difference]: With dead ends: 50 [2024-11-18 13:05:59,838 INFO L226 Difference]: Without dead ends: 21 [2024-11-18 13:05:59,840 INFO L431 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 [2024-11-18 13:05:59,842 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:05:59,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:05:59,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-18 13:05:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-18 13:05:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 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) [2024-11-18 13:05:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-18 13:05:59,867 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2024-11-18 13:05:59,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:05:59,867 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-18 13:05:59,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2024-11-18 13:05:59,868 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-18 13:05:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-18 13:05:59,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:05:59,868 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:05:59,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 13:05:59,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:05:59,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:05:59,870 INFO L85 PathProgramCache]: Analyzing trace with hash 283143297, now seen corresponding path program 1 times [2024-11-18 13:05:59,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:05:59,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698971916] [2024-11-18 13:05:59,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:05:59,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:05:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:06:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:00,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:06:00,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698971916] [2024-11-18 13:06:00,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698971916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:06:00,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:06:00,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 13:06:00,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590522372] [2024-11-18 13:06:00,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:06:00,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:06:00,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:06:00,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:06:00,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:06:00,088 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-11-18 13:06:00,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:06:00,138 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-11-18 13:06:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 13:06:00,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2024-11-18 13:06:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:06:00,139 INFO L225 Difference]: With dead ends: 38 [2024-11-18 13:06:00,139 INFO L226 Difference]: Without dead ends: 34 [2024-11-18 13:06:00,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:06:00,140 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:06:00,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:06:00,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-18 13:06:00,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-18 13:06:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 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) [2024-11-18 13:06:00,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-11-18 13:06:00,145 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2024-11-18 13:06:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:06:00,146 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-11-18 13:06:00,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-11-18 13:06:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-11-18 13:06:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 13:06:00,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:06:00,146 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:06:00,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 13:06:00,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:06:00,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:06:00,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1566445212, now seen corresponding path program 1 times [2024-11-18 13:06:00,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:06:00,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684341261] [2024-11-18 13:06:00,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:06:00,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:06:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:06:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:00,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:06:00,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684341261] [2024-11-18 13:06:00,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684341261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:06:00,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:06:00,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 13:06:00,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640363469] [2024-11-18 13:06:00,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:06:00,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:06:00,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:06:00,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:06:00,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:06:00,305 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:06:00,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:06:00,362 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-18 13:06:00,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 13:06:00,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-18 13:06:00,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:06:00,364 INFO L225 Difference]: With dead ends: 40 [2024-11-18 13:06:00,365 INFO L226 Difference]: Without dead ends: 32 [2024-11-18 13:06:00,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 13:06:00,366 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:06:00,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:06:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-18 13:06:00,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-18 13:06:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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) [2024-11-18 13:06:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-18 13:06:00,372 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2024-11-18 13:06:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:06:00,373 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-18 13:06:00,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:06:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-18 13:06:00,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 13:06:00,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:06:00,378 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:06:00,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 13:06:00,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:06:00,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:06:00,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1703819108, now seen corresponding path program 1 times [2024-11-18 13:06:00,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:06:00,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332038906] [2024-11-18 13:06:00,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:06:00,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:06:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:06:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:00,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:06:00,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332038906] [2024-11-18 13:06:00,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332038906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:06:00,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:06:00,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 13:06:00,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249231182] [2024-11-18 13:06:00,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:06:00,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:06:00,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:06:00,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:06:00,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:06:00,525 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:06:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:06:00,578 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-18 13:06:00,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 13:06:00,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-18 13:06:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:06:00,579 INFO L225 Difference]: With dead ends: 40 [2024-11-18 13:06:00,580 INFO L226 Difference]: Without dead ends: 29 [2024-11-18 13:06:00,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 13:06:00,581 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:06:00,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:06:00,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-18 13:06:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-11-18 13:06:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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) [2024-11-18 13:06:00,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-18 13:06:00,587 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2024-11-18 13:06:00,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:06:00,588 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-18 13:06:00,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:06:00,588 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-18 13:06:00,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-18 13:06:00,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:06:00,589 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:06:00,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 13:06:00,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:06:00,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:06:00,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1538293272, now seen corresponding path program 1 times [2024-11-18 13:06:00,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:06:00,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095565659] [2024-11-18 13:06:00,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:06:00,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:06:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:06:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:00,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:06:00,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095565659] [2024-11-18 13:06:00,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095565659] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:06:00,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208042511] [2024-11-18 13:06:00,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:06:00,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:06:00,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:06:00,980 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) [2024-11-18 13:06:00,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 13:06:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:06:01,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-18 13:06:01,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:06:01,170 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 [2024-11-18 13:06:01,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-18 13:06:01,273 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-18 13:06:01,273 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 26 [2024-11-18 13:06:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:01,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:06:01,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:01,785 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 309 treesize of output 313 [2024-11-18 13:06:02,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:06:02,127 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 203 treesize of output 195 [2024-11-18 13:06:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:02,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208042511] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:06:02,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:06:02,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2024-11-18 13:06:02,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194448633] [2024-11-18 13:06:02,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:06:02,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-18 13:06:02,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:06:02,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-18 13:06:02,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=270, Unknown=9, NotChecked=0, Total=342 [2024-11-18 13:06:02,159 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 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) [2024-11-18 13:06:02,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:06:02,470 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2024-11-18 13:06:02,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-18 13:06:02,471 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 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 [2024-11-18 13:06:02,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:06:02,473 INFO L225 Difference]: With dead ends: 53 [2024-11-18 13:06:02,473 INFO L226 Difference]: Without dead ends: 47 [2024-11-18 13:06:02,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=560, Unknown=10, NotChecked=0, Total=702 [2024-11-18 13:06:02,474 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:06:02,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 160 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 13:06:02,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-18 13:06:02,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2024-11-18 13:06:02,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 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) [2024-11-18 13:06:02,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-11-18 13:06:02,480 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 20 [2024-11-18 13:06:02,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:06:02,480 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-18 13:06:02,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 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) [2024-11-18 13:06:02,481 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-11-18 13:06:02,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-18 13:06:02,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:06:02,481 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:06:02,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 13:06:02,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:06:02,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:06:02,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:06:02,687 INFO L85 PathProgramCache]: Analyzing trace with hash -674891608, now seen corresponding path program 1 times [2024-11-18 13:06:02,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:06:02,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145037062] [2024-11-18 13:06:02,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:06:02,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:06:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:06:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:02,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:06:02,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145037062] [2024-11-18 13:06:02,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145037062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:06:02,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002851188] [2024-11-18 13:06:02,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:06:02,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:06:02,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:06:02,924 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) [2024-11-18 13:06:02,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 13:06:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:06:03,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-18 13:06:03,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:06:03,008 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 [2024-11-18 13:06:03,032 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 [2024-11-18 13:06:03,041 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-18 13:06:03,042 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 [2024-11-18 13:06:03,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-18 13:06:03,096 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 [2024-11-18 13:06:03,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:03,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:06:03,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_131 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_131) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 1 .cse0) (= 2 .cse0)))) is different from false [2024-11-18 13:06:03,210 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_131 (Array Int Int)) (v_ArrVal_130 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_130) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_131) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1 (select v_ArrVal_130 .cse1))) v_ArrVal_130)) (= .cse0 2)))) is different from false [2024-11-18 13:06:03,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:03,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 123 [2024-11-18 13:06:03,254 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 99 treesize of output 91 [2024-11-18 13:06:03,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-18 13:06:03,320 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 123 treesize of output 119 [2024-11-18 13:06:03,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-18 13:06:03,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002851188] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:06:03,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:06:03,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 10] total 17 [2024-11-18 13:06:03,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351854407] [2024-11-18 13:06:03,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:06:03,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-18 13:06:03,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:06:03,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-18 13:06:03,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=170, Unknown=2, NotChecked=54, Total=272 [2024-11-18 13:06:03,415 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:06:03,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:06:03,590 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2024-11-18 13:06:03,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 13:06:03,590 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-18 13:06:03,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:06:03,591 INFO L225 Difference]: With dead ends: 57 [2024-11-18 13:06:03,591 INFO L226 Difference]: Without dead ends: 51 [2024-11-18 13:06:03,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=365, Unknown=2, NotChecked=82, Total=552 [2024-11-18 13:06:03,592 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 46 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:06:03,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 143 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 149 Invalid, 0 Unknown, 75 Unchecked, 0.1s Time] [2024-11-18 13:06:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-18 13:06:03,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-11-18 13:06:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:06:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2024-11-18 13:06:03,596 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 20 [2024-11-18 13:06:03,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:06:03,597 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2024-11-18 13:06:03,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:06:03,597 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2024-11-18 13:06:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-18 13:06:03,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:06:03,598 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:06:03,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 13:06:03,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-18 13:06:03,802 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:06:03,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:06:03,803 INFO L85 PathProgramCache]: Analyzing trace with hash -782408125, now seen corresponding path program 1 times [2024-11-18 13:06:03,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:06:03,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643342407] [2024-11-18 13:06:03,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:06:03,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:06:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:06:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:04,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:06:04,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643342407] [2024-11-18 13:06:04,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643342407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:06:04,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167679754] [2024-11-18 13:06:04,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:06:04,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:06:04,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:06:04,067 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) [2024-11-18 13:06:04,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 13:06:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:06:04,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-18 13:06:04,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:06:04,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-18 13:06:04,200 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 [2024-11-18 13:06:04,244 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2024-11-18 13:06:04,245 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 52 treesize of output 51 [2024-11-18 13:06:04,257 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-18 13:06:04,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2024-11-18 13:06:04,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-18 13:06:04,275 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 15 treesize of output 11 [2024-11-18 13:06:04,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-18 13:06:04,351 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 7 treesize of output 3 [2024-11-18 13:06:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:04,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:06:04,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:04,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 97 [2024-11-18 13:06:04,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:04,509 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 45 treesize of output 46 [2024-11-18 13:06:04,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:04,517 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 35 treesize of output 36 [2024-11-18 13:06:04,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:04,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2024-11-18 13:06:04,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:04,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2024-11-18 13:06:04,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2024-11-18 13:06:04,548 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 37 treesize of output 33 [2024-11-18 13:06:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:04,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167679754] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:06:04,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:06:04,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2024-11-18 13:06:04,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157565919] [2024-11-18 13:06:04,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:06:04,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-18 13:06:04,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:06:04,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-18 13:06:04,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-11-18 13:06:04,612 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:06:04,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:06:04,963 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2024-11-18 13:06:04,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-18 13:06:04,963 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-18 13:06:04,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:06:04,964 INFO L225 Difference]: With dead ends: 71 [2024-11-18 13:06:04,964 INFO L226 Difference]: Without dead ends: 56 [2024-11-18 13:06:04,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2024-11-18 13:06:04,964 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 42 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:06:04,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 145 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 13:06:04,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-18 13:06:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2024-11-18 13:06:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:06:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2024-11-18 13:06:04,974 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 22 [2024-11-18 13:06:04,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:06:04,974 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2024-11-18 13:06:04,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:06:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2024-11-18 13:06:04,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 13:06:04,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:06:04,976 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:06:04,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 13:06:05,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:06:05,177 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:06:05,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:06:05,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1990497246, now seen corresponding path program 1 times [2024-11-18 13:06:05,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:06:05,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541064268] [2024-11-18 13:06:05,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:06:05,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:06:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:06:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 13:06:05,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:06:05,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541064268] [2024-11-18 13:06:05,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541064268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:06:05,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415270510] [2024-11-18 13:06:05,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:06:05,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:06:05,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:06:05,316 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:06:05,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 13:06:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:06:05,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-18 13:06:05,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:06:05,426 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 [2024-11-18 13:06:05,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-18 13:06:05,523 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-18 13:06:05,523 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 [2024-11-18 13:06:05,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:05,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2024-11-18 13:06:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 13:06:05,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:06:05,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:05,717 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 305 treesize of output 311 [2024-11-18 13:06:05,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-18 13:06:05,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-18 13:06:05,829 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 118 treesize of output 114 [2024-11-18 13:06:05,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2024-11-18 13:06:05,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:06:05,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:06:05,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 13:06:05,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415270510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:06:05,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:06:05,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2024-11-18 13:06:05,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532897981] [2024-11-18 13:06:05,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:06:05,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-18 13:06:05,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:06:05,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-18 13:06:05,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=279, Unknown=1, NotChecked=0, Total=342 [2024-11-18 13:06:05,912 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:06:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:06:06,238 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2024-11-18 13:06:06,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 13:06:06,238 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-18 13:06:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:06:06,239 INFO L225 Difference]: With dead ends: 64 [2024-11-18 13:06:06,239 INFO L226 Difference]: Without dead ends: 51 [2024-11-18 13:06:06,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=709, Unknown=1, NotChecked=0, Total=870 [2024-11-18 13:06:06,240 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 43 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:06:06,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 101 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:06:06,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-18 13:06:06,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-11-18 13:06:06,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:06:06,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2024-11-18 13:06:06,246 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 24 [2024-11-18 13:06:06,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:06:06,246 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-11-18 13:06:06,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:06:06,247 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-11-18 13:06:06,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 13:06:06,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:06:06,247 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:06:06,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-18 13:06:06,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:06:06,448 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:06:06,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:06:06,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2004768098, now seen corresponding path program 1 times [2024-11-18 13:06:06,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:06:06,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951616812] [2024-11-18 13:06:06,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:06:06,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:06:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:06:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:06,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:06:06,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951616812] [2024-11-18 13:06:06,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951616812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:06:06,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219401573] [2024-11-18 13:06:06,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:06:06,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:06:06,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:06:06,781 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:06:06,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 13:06:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:06:06,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-18 13:06:06,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:06:06,885 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 [2024-11-18 13:06:06,926 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-18 13:06:06,926 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 [2024-11-18 13:06:06,947 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 19 treesize of output 1 [2024-11-18 13:06:06,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-18 13:06:07,008 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-18 13:06:07,009 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 80 treesize of output 73 [2024-11-18 13:06:07,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2024-11-18 13:06:07,018 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 40 treesize of output 23 [2024-11-18 13:06:07,061 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 39 treesize of output 21 [2024-11-18 13:06:07,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-18 13:06:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:07,076 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:06:07,109 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 52 treesize of output 30 [2024-11-18 13:06:07,115 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_282 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_282) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_281 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_281) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2024-11-18 13:06:07,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:07,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-18 13:06:07,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:07,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-18 13:06:07,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 13:06:07,179 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-18 13:06:07,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-18 13:06:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-18 13:06:07,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219401573] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:06:07,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:06:07,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-18 13:06:07,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47117092] [2024-11-18 13:06:07,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:06:07,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-18 13:06:07,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:06:07,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-18 13:06:07,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2024-11-18 13:06:07,247 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 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) [2024-11-18 13:06:07,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:06:07,450 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2024-11-18 13:06:07,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-18 13:06:07,451 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-18 13:06:07,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:06:07,451 INFO L225 Difference]: With dead ends: 61 [2024-11-18 13:06:07,451 INFO L226 Difference]: Without dead ends: 48 [2024-11-18 13:06:07,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=541, Unknown=1, NotChecked=48, Total=702 [2024-11-18 13:06:07,452 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 57 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:06:07,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 135 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 166 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2024-11-18 13:06:07,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-18 13:06:07,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2024-11-18 13:06:07,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 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) [2024-11-18 13:06:07,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-18 13:06:07,455 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 24 [2024-11-18 13:06:07,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:06:07,455 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-18 13:06:07,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 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) [2024-11-18 13:06:07,456 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-18 13:06:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 13:06:07,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:06:07,456 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:06:07,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 13:06:07,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:06:07,661 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:06:07,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:06:07,661 INFO L85 PathProgramCache]: Analyzing trace with hash 666149519, now seen corresponding path program 1 times [2024-11-18 13:06:07,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:06:07,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842524550] [2024-11-18 13:06:07,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:06:07,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:06:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:06:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:07,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:06:07,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842524550] [2024-11-18 13:06:07,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842524550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:06:07,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097420717] [2024-11-18 13:06:07,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:06:07,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:06:07,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:06:07,911 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:06:07,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 13:06:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:06:07,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-18 13:06:07,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:06:07,985 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 [2024-11-18 13:06:08,013 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-18 13:06:08,014 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 [2024-11-18 13:06:08,017 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 [2024-11-18 13:06:08,035 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 [2024-11-18 13:06:08,050 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 [2024-11-18 13:06:08,076 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 [2024-11-18 13:06:08,105 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-18 13:06:08,105 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 [2024-11-18 13:06:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:08,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:06:08,245 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_364 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_364))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_61| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_61|) |c_ULTIMATE.start_main_~t~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2024-11-18 13:06:08,255 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_364 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_364))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_61| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_61|) 0 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))) is different from false [2024-11-18 13:06:08,279 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_364 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_360) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_364))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_61| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_61|) 0 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_360 (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1 (select v_ArrVal_360 .cse1)))))))) is different from false [2024-11-18 13:06:08,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:08,305 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 1683 treesize of output 1663 [2024-11-18 13:06:08,339 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 615 treesize of output 579 [2024-11-18 13:06:08,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-18 13:06:08,881 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-18 13:06:08,894 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 130 treesize of output 126 [2024-11-18 13:06:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-18 13:06:08,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097420717] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:06:08,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:06:08,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-11-18 13:06:08,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430605727] [2024-11-18 13:06:08,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:06:08,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-18 13:06:08,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:06:08,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-18 13:06:08,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=316, Unknown=3, NotChecked=114, Total=506 [2024-11-18 13:06:08,960 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:06:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:06:09,336 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2024-11-18 13:06:09,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-18 13:06:09,336 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-18 13:06:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:06:09,337 INFO L225 Difference]: With dead ends: 77 [2024-11-18 13:06:09,337 INFO L226 Difference]: Without dead ends: 72 [2024-11-18 13:06:09,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=759, Unknown=3, NotChecked=180, Total=1122 [2024-11-18 13:06:09,338 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:06:09,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 188 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 262 Invalid, 0 Unknown, 205 Unchecked, 0.2s Time] [2024-11-18 13:06:09,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-18 13:06:09,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2024-11-18 13:06:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 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) [2024-11-18 13:06:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2024-11-18 13:06:09,341 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 24 [2024-11-18 13:06:09,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:06:09,342 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2024-11-18 13:06:09,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:06:09,342 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2024-11-18 13:06:09,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 13:06:09,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:06:09,342 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:06:09,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 13:06:09,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:06:09,544 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:06:09,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:06:09,544 INFO L85 PathProgramCache]: Analyzing trace with hash 17470058, now seen corresponding path program 2 times [2024-11-18 13:06:09,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:06:09,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000935094] [2024-11-18 13:06:09,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:06:09,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:06:09,556 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:06:09,556 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:06:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:09,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:06:09,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000935094] [2024-11-18 13:06:09,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000935094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:06:09,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083987764] [2024-11-18 13:06:09,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:06:09,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:06:09,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:06:09,961 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:06:09,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 13:06:10,037 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:06:10,037 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:06:10,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-18 13:06:10,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:06:10,043 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 [2024-11-18 13:06:10,082 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:06:10,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-18 13:06:10,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-18 13:06:10,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-18 13:06:10,164 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:06:10,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-18 13:06:10,167 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 [2024-11-18 13:06:10,178 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-18 13:06:10,178 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 33 treesize of output 24 [2024-11-18 13:06:10,194 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-18 13:06:10,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-18 13:06:10,205 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 [2024-11-18 13:06:10,252 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2024-11-18 13:06:10,252 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 175 treesize of output 125 [2024-11-18 13:06:10,255 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 128 treesize of output 105 [2024-11-18 13:06:10,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-11-18 13:06:10,320 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-18 13:06:10,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 135 [2024-11-18 13:06:10,330 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-18 13:06:10,330 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 128 treesize of output 121 [2024-11-18 13:06:10,341 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 52 treesize of output 19 [2024-11-18 13:06:10,389 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-18 13:06:10,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 30 [2024-11-18 13:06:10,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-18 13:06:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:10,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:06:10,481 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= v_ArrVal_450 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_450 .cse0)))) (= 2 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_453) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_454) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))))) is different from false [2024-11-18 13:06:10,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:10,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2024-11-18 13:06:10,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:10,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 266 [2024-11-18 13:06:10,506 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 226 treesize of output 190 [2024-11-18 13:06:10,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2024-11-18 13:06:10,536 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 160 treesize of output 142 [2024-11-18 13:06:10,574 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 30 treesize of output 22 [2024-11-18 13:06:10,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:10,687 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 63 treesize of output 53 [2024-11-18 13:06:10,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:10,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 170 [2024-11-18 13:06:10,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:10,700 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 165 treesize of output 113 [2024-11-18 13:06:10,703 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 99 treesize of output 83 [2024-11-18 13:06:10,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:10,806 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 65 treesize of output 55 [2024-11-18 13:06:10,808 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:06:10,813 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-18 13:06:10,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 57 [2024-11-18 13:06:10,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:10,820 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 63 treesize of output 51 [2024-11-18 13:06:10,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:10,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-18 13:06:10,842 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:06:10,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:10,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-11-18 13:06:10,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:06:10,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:10,871 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 34 treesize of output 35 [2024-11-18 13:06:10,874 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:06:10,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:10,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2024-11-18 13:06:10,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:10,891 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 41 treesize of output 33 [2024-11-18 13:06:10,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:10,924 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 29 treesize of output 30 [2024-11-18 13:06:10,930 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:06:10,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:10,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-18 13:06:10,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:10,956 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 22 treesize of output 22 [2024-11-18 13:06:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-18 13:06:11,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083987764] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:06:11,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:06:11,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2024-11-18 13:06:11,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684779210] [2024-11-18 13:06:11,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:06:11,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-18 13:06:11,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:06:11,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-18 13:06:11,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=466, Unknown=12, NotChecked=44, Total=600 [2024-11-18 13:06:11,631 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 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) [2024-11-18 13:06:12,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:06:12,071 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2024-11-18 13:06:12,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 13:06:12,071 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 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 26 [2024-11-18 13:06:12,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:06:12,072 INFO L225 Difference]: With dead ends: 76 [2024-11-18 13:06:12,072 INFO L226 Difference]: Without dead ends: 72 [2024-11-18 13:06:12,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=680, Unknown=13, NotChecked=54, Total=870 [2024-11-18 13:06:12,073 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 41 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 13:06:12,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 219 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 368 Invalid, 0 Unknown, 51 Unchecked, 0.3s Time] [2024-11-18 13:06:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-18 13:06:12,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2024-11-18 13:06:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.2) internal successors, (78), 65 states have internal predecessors, (78), 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) [2024-11-18 13:06:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2024-11-18 13:06:12,077 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 26 [2024-11-18 13:06:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:06:12,077 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2024-11-18 13:06:12,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 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) [2024-11-18 13:06:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2024-11-18 13:06:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 13:06:12,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:06:12,078 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:06:12,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-18 13:06:12,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:06:12,283 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:06:12,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:06:12,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1068548074, now seen corresponding path program 1 times [2024-11-18 13:06:12,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:06:12,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576570697] [2024-11-18 13:06:12,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:06:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:06:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:06:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:12,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:06:12,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576570697] [2024-11-18 13:06:12,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576570697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:06:12,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760855523] [2024-11-18 13:06:12,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:06:12,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:06:12,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:06:12,518 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:06:12,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 13:06:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:06:12,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-18 13:06:12,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:06:12,593 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 [2024-11-18 13:06:12,608 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 [2024-11-18 13:06:12,614 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-18 13:06:12,614 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 [2024-11-18 13:06:12,630 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 [2024-11-18 13:06:12,640 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 [2024-11-18 13:06:12,665 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 [2024-11-18 13:06:12,700 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-18 13:06:12,700 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 [2024-11-18 13:06:12,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:12,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2024-11-18 13:06:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:12,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:06:12,803 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_80| Int)) (not (= 2 (select (select (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_535))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_80| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_80|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2024-11-18 13:06:12,812 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_80| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_535))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_80| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_80|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))) is different from false [2024-11-18 13:06:12,822 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_80| Int)) (or (not (= v_ArrVal_531 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_531 .cse0))))) (not (= 2 (select (select (let ((.cse1 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_531) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_535))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_80| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_80|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2024-11-18 13:06:12,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:12,851 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 1437 treesize of output 1431 [2024-11-18 13:06:12,864 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 550 treesize of output 518 [2024-11-18 13:06:13,118 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 96 treesize of output 92 [2024-11-18 13:06:13,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:06:13,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-18 13:06:13,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:06:13,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:06:13,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-18 13:06:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-18 13:06:13,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760855523] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:06:13,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:06:13,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 24 [2024-11-18 13:06:13,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893853811] [2024-11-18 13:06:13,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:06:13,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-18 13:06:13,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:06:13,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-18 13:06:13,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=354, Unknown=3, NotChecked=120, Total=552 [2024-11-18 13:06:13,196 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:06:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:06:13,532 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2024-11-18 13:06:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-18 13:06:13,532 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-18 13:06:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:06:13,533 INFO L225 Difference]: With dead ends: 91 [2024-11-18 13:06:13,533 INFO L226 Difference]: Without dead ends: 77 [2024-11-18 13:06:13,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=988, Unknown=3, NotChecked=204, Total=1406 [2024-11-18 13:06:13,534 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 76 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:06:13,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 182 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 220 Invalid, 0 Unknown, 189 Unchecked, 0.1s Time] [2024-11-18 13:06:13,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-18 13:06:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2024-11-18 13:06:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 67 states have internal predecessors, (79), 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) [2024-11-18 13:06:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2024-11-18 13:06:13,538 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 26 [2024-11-18 13:06:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:06:13,539 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2024-11-18 13:06:13,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 13:06:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2024-11-18 13:06:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 13:06:13,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:06:13,540 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:06:13,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-18 13:06:13,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-18 13:06:13,741 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:06:13,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:06:13,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2093251050, now seen corresponding path program 2 times [2024-11-18 13:06:13,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:06:13,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119685466] [2024-11-18 13:06:13,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:06:13,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:06:13,762 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:06:13,762 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:06:14,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:14,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:06:14,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119685466] [2024-11-18 13:06:14,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119685466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:06:14,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593347758] [2024-11-18 13:06:14,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:06:14,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:06:14,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:06:14,225 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:06:14,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-18 13:06:14,297 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:06:14,297 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:06:14,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-18 13:06:14,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:06:14,304 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 [2024-11-18 13:06:14,323 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-18 13:06:14,323 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 [2024-11-18 13:06:14,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-18 13:06:14,360 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 [2024-11-18 13:06:14,388 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 [2024-11-18 13:06:14,399 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:06:14,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-18 13:06:14,411 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-18 13:06:14,411 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 24 treesize of output 17 [2024-11-18 13:06:14,460 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-18 13:06:14,460 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 93 treesize of output 80 [2024-11-18 13:06:14,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-18 13:06:14,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-18 13:06:14,539 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:06:14,540 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 39 treesize of output 34 [2024-11-18 13:06:14,551 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-18 13:06:14,551 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 21 treesize of output 26 [2024-11-18 13:06:14,569 INFO L349 Elim1Store]: treesize reduction 28, result has 45.1 percent of original size [2024-11-18 13:06:14,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2024-11-18 13:06:14,589 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 37 treesize of output 27 [2024-11-18 13:06:14,765 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 73 treesize of output 53 [2024-11-18 13:06:14,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2024-11-18 13:06:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:14,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:06:19,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:19,339 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 681 treesize of output 709 [2024-11-18 13:06:19,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:19,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 479 treesize of output 437 [2024-11-18 13:06:19,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-18 13:06:19,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-18 13:06:19,677 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 61 treesize of output 19 [2024-11-18 13:06:19,704 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 61 treesize of output 19 [2024-11-18 13:06:19,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:19,719 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 83 treesize of output 59 [2024-11-18 13:06:19,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:19,895 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 187 treesize of output 161 [2024-11-18 13:06:20,026 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 10 treesize of output 8 [2024-11-18 13:06:20,097 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 10 treesize of output 8 [2024-11-18 13:06:20,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:20,150 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 1390 treesize of output 1316 [2024-11-18 13:06:21,595 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 [2024-11-18 13:06:21,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-18 13:06:21,708 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))) (let ((.cse24 (not .cse0)) (.cse22 (not (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse30) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= .cse30 0)))))) (let ((.cse16 (or .cse22 .cse4)) (.cse17 (or .cse24 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse29) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= .cse29 .cse2) (= .cse29 0)))))) (.cse21 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_91| .cse28) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.base|))))) (.cse23 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_11 .cse2) 0))))) (.cse5 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse6 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or .cse0 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse3 0) (not (= .cse3 .cse2)))))) (or .cse4 .cse5 .cse6) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse7) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse7 0)))) .cse6) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse2) 0)) (forall ((v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_91| .cse8) (forall ((v_ArrVal_622 (Array Int Int))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse8 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or .cse0 (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse2) 0)) (forall ((v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (or (forall ((v_ArrVal_622 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse9) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse2) 0)) (forall ((v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_622 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse10) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse10) (= .cse10 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~a~0#1.base|))))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse11 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_ArrVal_622 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0))))) (not (= (select v_arrayElimArr_11 .cse2) 0)))) (or (forall ((v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_91| .cse12) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse5) (or (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_622 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse13) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse13) (= .cse13 0)))))) (not (= (select v_arrayElimArr_11 .cse2) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse2) 0)) (forall ((v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (or (forall ((v_ArrVal_622 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse14) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse14)))) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))))))) .cse0 .cse5) (or .cse0 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_11 .cse2) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse15) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse15 0))))) (or (and (or .cse0 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2))))) (or (and (or .cse0 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_11 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2))))) .cse16 .cse17) .cse5)) (= .cse2 0)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_11 .cse2) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse18) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse18 0)))) .cse5 .cse6) (or (and .cse16 .cse17 (or .cse0 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= .cse19 0) (not (= .cse19 .cse2))))))) .cse5) (forall ((v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_91| .cse20) (= .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse20 |c_ULTIMATE.start_main_~p~0#1.base|)))) (or .cse5 .cse6 .cse21) (or .cse5 (and (or .cse22 .cse23) (or .cse0 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_11 .cse2) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2))))) (or .cse24 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse25) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= .cse25 .cse2))))))) (or .cse0 .cse5 .cse21) (or .cse0 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2))))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~a~0#1.base|))) .cse6) (or .cse24 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse26) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse26 .cse2))))) (or .cse23 .cse5 .cse6) (or .cse24 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_622) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse27) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_621) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_11 .cse2) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_91| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse27 .cse2) (= .cse27 0)))))))))) is different from false [2024-11-18 13:06:22,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,367 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-11-18 13:06:22,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,373 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 26 treesize of output 27 [2024-11-18 13:06:22,376 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:06:22,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2024-11-18 13:06:22,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,397 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 35 treesize of output 35 [2024-11-18 13:06:22,446 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:06:22,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,454 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 39 treesize of output 38 [2024-11-18 13:06:22,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-18 13:06:22,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2024-11-18 13:06:22,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,477 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 26 treesize of output 27 [2024-11-18 13:06:22,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 269 treesize of output 250 [2024-11-18 13:06:22,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:06:22,498 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2024-11-18 13:06:22,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:06:22,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2024-11-18 13:06:22,508 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 [2024-11-18 13:06:22,511 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 57 treesize of output 41 [2024-11-18 13:06:22,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,534 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 58 [2024-11-18 13:06:22,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,543 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 26 treesize of output 27 [2024-11-18 13:06:22,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 414 treesize of output 383 [2024-11-18 13:06:22,568 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:06:22,569 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 88 treesize of output 72 [2024-11-18 13:06:22,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 74 [2024-11-18 13:06:22,594 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 58 treesize of output 54 [2024-11-18 13:06:22,601 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 54 treesize of output 46 [2024-11-18 13:06:22,607 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 89 treesize of output 65 [2024-11-18 13:06:22,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-11-18 13:06:22,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,680 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 26 treesize of output 27 [2024-11-18 13:06:22,684 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:06:22,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:06:22,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:06:22,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2024-11-18 13:06:22,692 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 [2024-11-18 13:06:22,694 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 10 treesize of output 4 [2024-11-18 13:06:22,697 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 [2024-11-18 13:06:22,702 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 10 treesize of output 6 [2024-11-18 13:06:22,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-11-18 13:06:22,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-18 13:06:22,720 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:06:22,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,728 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 43 treesize of output 42 [2024-11-18 13:06:22,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,736 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 35 treesize of output 35 [2024-11-18 13:06:22,757 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:06:22,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2024-11-18 13:06:22,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-18 13:06:22,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2024-11-18 13:06:22,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-18 13:06:22,793 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:06:22,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:06:22,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:06:22,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2024-11-18 13:06:22,803 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 [2024-11-18 13:06:22,806 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 10 treesize of output 4 [2024-11-18 13:06:22,809 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 [2024-11-18 13:06:22,811 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 15 treesize of output 7 [2024-11-18 13:06:22,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,819 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 24 treesize of output 25 [2024-11-18 13:06:22,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 41 [2024-11-18 13:06:22,832 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:06:22,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,841 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 59 treesize of output 56 [2024-11-18 13:06:22,845 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:06:22,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,852 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 35 treesize of output 36 [2024-11-18 13:06:22,855 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 20 treesize of output 18 [2024-11-18 13:06:22,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2024-11-18 13:06:22,883 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-18 13:06:22,890 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-18 13:06:22,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 1 [2024-11-18 13:06:22,897 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-18 13:06:22,897 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 23 treesize of output 1 [2024-11-18 13:06:22,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,902 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 70 treesize of output 50 [2024-11-18 13:06:22,905 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:06:22,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:22,912 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 74 treesize of output 67 [2024-11-18 13:06:22,916 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 28 treesize of output 22 [2024-11-18 13:06:22,933 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-18 13:06:22,934 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 23 treesize of output 1 [2024-11-18 13:06:22,943 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-18 13:06:22,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2024-11-18 13:06:22,950 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-18 13:06:22,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2024-11-18 13:06:22,957 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-18 13:06:22,957 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 47 treesize of output 1 [2024-11-18 13:06:22,961 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-18 13:06:22,967 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-18 13:06:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-18 13:06:23,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593347758] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:06:23,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:06:23,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 33 [2024-11-18 13:06:23,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486077415] [2024-11-18 13:06:23,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:06:23,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-18 13:06:23,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:06:23,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-18 13:06:23,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=880, Unknown=11, NotChecked=60, Total=1056 [2024-11-18 13:06:23,093 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 33 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 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) [2024-11-18 13:06:28,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-18 13:06:32,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-18 13:06:32,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:06:32,590 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2024-11-18 13:06:32,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-18 13:06:32,591 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 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 26 [2024-11-18 13:06:32,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:06:32,591 INFO L225 Difference]: With dead ends: 97 [2024-11-18 13:06:32,591 INFO L226 Difference]: Without dead ends: 89 [2024-11-18 13:06:32,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=256, Invalid=2088, Unknown=12, NotChecked=94, Total=2450 [2024-11-18 13:06:32,593 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 80 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 37 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-18 13:06:32,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 359 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 659 Invalid, 4 Unknown, 68 Unchecked, 8.6s Time] [2024-11-18 13:06:32,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-18 13:06:32,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2024-11-18 13:06:32,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 79 states have internal predecessors, (94), 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) [2024-11-18 13:06:32,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2024-11-18 13:06:32,598 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 26 [2024-11-18 13:06:32,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:06:32,598 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-11-18 13:06:32,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 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) [2024-11-18 13:06:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2024-11-18 13:06:32,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-18 13:06:32,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:06:32,599 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:06:32,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-18 13:06:32,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-18 13:06:32,804 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:06:32,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:06:32,804 INFO L85 PathProgramCache]: Analyzing trace with hash -342467003, now seen corresponding path program 3 times [2024-11-18 13:06:32,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:06:32,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950064245] [2024-11-18 13:06:32,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 13:06:32,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:06:32,817 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-18 13:06:32,817 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:06:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:33,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:06:33,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950064245] [2024-11-18 13:06:33,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950064245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:06:33,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036325264] [2024-11-18 13:06:33,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 13:06:33,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:06:33,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:06:33,558 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:06:33,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-18 13:06:33,661 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-18 13:06:33,661 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:06:33,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-18 13:06:33,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:06:33,676 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 [2024-11-18 13:06:33,723 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:06:33,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-18 13:06:33,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-18 13:06:33,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-18 13:06:33,846 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:06:33,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-18 13:06:33,849 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 [2024-11-18 13:06:33,868 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-18 13:06:33,868 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 33 treesize of output 24 [2024-11-18 13:06:33,883 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-18 13:06:33,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-18 13:06:33,933 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2024-11-18 13:06:33,933 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 161 treesize of output 119 [2024-11-18 13:06:33,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 92 [2024-11-18 13:06:34,010 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-18 13:06:34,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 137 [2024-11-18 13:06:34,026 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2024-11-18 13:06:34,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 126 [2024-11-18 13:06:34,032 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 53 treesize of output 35 [2024-11-18 13:06:34,153 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-18 13:06:34,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 49 [2024-11-18 13:06:34,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-18 13:06:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:06:34,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:06:34,199 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 187 treesize of output 129 [2024-11-18 13:06:34,205 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_708 (Array Int Int))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_710))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_708 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_708))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_710) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2024-11-18 13:06:34,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_98| Int)) (= |v_ULTIMATE.start_main_~p~0#1.offset_98| (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_main_~p~0#1.offset_98|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_708))) (select (select .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_710) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_98| Int)) (= (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_710))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_main_~p~0#1.offset_98|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) |c_ULTIMATE.start_main_~t~0#1.base|))))) is different from false [2024-11-18 13:06:34,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:34,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 103 [2024-11-18 13:06:34,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:34,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 137 [2024-11-18 13:06:34,262 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 13 treesize of output 1 [2024-11-18 13:06:34,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:34,335 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 85 treesize of output 86 [2024-11-18 13:06:34,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:34,340 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 75 treesize of output 66 [2024-11-18 13:06:34,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:34,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 2718 treesize of output 1887 [2024-11-18 13:06:34,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:34,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5316 treesize of output 4961 [2024-11-18 13:06:34,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:34,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 640 treesize of output 640 [2024-11-18 13:06:34,577 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 800 treesize of output 704 [2024-11-18 13:06:34,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:34,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 524 treesize of output 510 [2024-11-18 13:06:34,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:06:34,674 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 662 treesize of output 522