./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/queue_longer.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 08:27:50,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 08:27:50,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2024-11-11 08:27:50,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 08:27:50,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 08:27:50,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 08:27:50,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 08:27:50,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 08:27:50,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 08:27:50,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 08:27:50,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 08:27:50,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 08:27:50,220 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 08:27:50,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 08:27:50,221 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 08:27:50,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 08:27:50,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 08:27:50,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 08:27:50,223 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-11 08:27:50,223 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-11 08:27:50,223 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-11 08:27:50,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 08:27:50,227 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-11 08:27:50,227 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 08:27:50,227 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-11 08:27:50,228 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 08:27:50,228 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 08:27:50,228 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 08:27:50,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 08:27:50,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 08:27:50,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 08:27:50,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-11 08:27:50,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 08:27:50,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 08:27:50,230 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 08:27:50,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 08:27:50,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 08:27:50,231 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-11 08:27:50,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-11 08:27:50,231 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-11 08:27:50,233 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-11 08:27:50,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-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/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter 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 -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2024-11-11 08:27:50,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 08:27:50,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 08:27:50,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 08:27:50,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 08:27:50,510 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 08:27:50,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/queue_longer.i [2024-11-11 08:27:51,942 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 08:27:52,177 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 08:27:52,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i [2024-11-11 08:27:52,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/615f76c0c/9d4f8526c28448b9a180959e8089d83b/FLAG426d10420 [2024-11-11 08:27:52,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/615f76c0c/9d4f8526c28448b9a180959e8089d83b [2024-11-11 08:27:52,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 08:27:52,224 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 08:27:52,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 08:27:52,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 08:27:52,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 08:27:52,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:27:52" (1/1) ... [2024-11-11 08:27:52,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ae91285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:27:52, skipping insertion in model container [2024-11-11 08:27:52,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:27:52" (1/1) ... [2024-11-11 08:27:52,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 08:27:52,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 08:27:52,910 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 08:27:52,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 08:27:53,093 INFO L204 MainTranslator]: Completed translation [2024-11-11 08:27:53,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:27:53 WrapperNode [2024-11-11 08:27:53,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 08:27:53,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 08:27:53,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 08:27:53,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 08:27:53,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:27:53" (1/1) ... [2024-11-11 08:27:53,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:27:53" (1/1) ... [2024-11-11 08:27:53,221 INFO L138 Inliner]: procedures = 274, calls = 859, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1046 [2024-11-11 08:27:53,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 08:27:53,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 08:27:53,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 08:27:53,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 08:27:53,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:27:53" (1/1) ... [2024-11-11 08:27:53,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:27:53" (1/1) ... [2024-11-11 08:27:53,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:27:53" (1/1) ... [2024-11-11 08:27:53,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:27:53" (1/1) ... [2024-11-11 08:27:53,292 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:27:53" (1/1) ... [2024-11-11 08:27:53,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:27:53" (1/1) ... [2024-11-11 08:27:53,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:27:53" (1/1) ... [2024-11-11 08:27:53,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:27:53" (1/1) ... [2024-11-11 08:27:53,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 08:27:53,324 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 08:27:53,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 08:27:53,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 08:27:53,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:27:53" (1/1) ... [2024-11-11 08:27:53,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-11 08:27:53,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:27:53,361 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-11 08:27:53,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-11 08:27:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-11 08:27:53,410 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-11 08:27:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-11 08:27:53,410 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-11 08:27:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-11 08:27:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-11 08:27:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-11 08:27:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-11 08:27:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 08:27:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-11 08:27:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 08:27:53,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 08:27:53,413 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-11 08:27:53,563 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 08:27:53,565 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 08:27:54,910 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-11 08:27:54,910 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 08:28:01,632 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 08:28:01,633 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 08:28:01,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:28:01 BoogieIcfgContainer [2024-11-11 08:28:01,633 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 08:28:01,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 08:28:01,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 08:28:01,639 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 08:28:01,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:27:52" (1/3) ... [2024-11-11 08:28:01,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403b9312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:28:01, skipping insertion in model container [2024-11-11 08:28:01,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:27:53" (2/3) ... [2024-11-11 08:28:01,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403b9312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:28:01, skipping insertion in model container [2024-11-11 08:28:01,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:28:01" (3/3) ... [2024-11-11 08:28:01,642 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-11-11 08:28:01,661 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 08:28:01,661 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2024-11-11 08:28:01,661 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-11 08:28:01,827 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-11 08:28:01,889 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 08:28:01,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-11 08:28:01,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:28:01,892 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-11 08:28:01,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-11 08:28:01,930 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-11 08:28:01,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-11 08:28:01,950 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@76f034de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 08:28:01,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-11 08:28:02,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:28:02,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:28:02,321 INFO L85 PathProgramCache]: Analyzing trace with hash -994868920, now seen corresponding path program 1 times [2024-11-11 08:28:02,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:28:02,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467105642] [2024-11-11 08:28:02,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:28:02,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:28:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:28:02,905 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-11 08:28:02,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:28:02,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467105642] [2024-11-11 08:28:02,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467105642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:28:02,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:28:02,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 08:28:02,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337469463] [2024-11-11 08:28:02,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:28:02,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:28:02,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:28:02,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:28:02,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:28:02,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:02,945 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:28:02,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 08:28:02,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:03,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:03,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 08:28:03,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:28:03,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:28:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash -994868919, now seen corresponding path program 1 times [2024-11-11 08:28:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:28:03,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378463146] [2024-11-11 08:28:03,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:28:03,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:28:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:28:04,977 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-11 08:28:04,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:28:04,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378463146] [2024-11-11 08:28:04,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378463146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:28:04,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:28:04,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 08:28:04,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585319977] [2024-11-11 08:28:04,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:28:04,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 08:28:04,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:28:04,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 08:28:04,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 08:28:04,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:04,984 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:28:04,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 08:28:04,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:04,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:05,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:05,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:05,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 08:28:05,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:28:05,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:28:05,859 INFO L85 PathProgramCache]: Analyzing trace with hash 494858813, now seen corresponding path program 1 times [2024-11-11 08:28:05,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:28:05,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937889493] [2024-11-11 08:28:05,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:28:05,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:28:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:28:06,057 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-11 08:28:06,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:28:06,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937889493] [2024-11-11 08:28:06,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937889493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:28:06,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:28:06,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 08:28:06,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881584605] [2024-11-11 08:28:06,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:28:06,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:28:06,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:28:06,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:28:06,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:28:06,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:06,061 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:28:06,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-11 08:28:06,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:06,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:06,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:06,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:06,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:06,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:06,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 08:28:06,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:28:06,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:28:06,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2068756552, now seen corresponding path program 1 times [2024-11-11 08:28:06,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:28:06,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943051170] [2024-11-11 08:28:06,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:28:06,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:28:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:28:06,452 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-11 08:28:06,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:28:06,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943051170] [2024-11-11 08:28:06,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943051170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:28:06,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:28:06,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-11 08:28:06,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934705565] [2024-11-11 08:28:06,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:28:06,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:28:06,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:28:06,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:28:06,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:28:06,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:06,456 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:28:06,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 08:28:06,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:06,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:06,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:06,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:06,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:06,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 08:28:06,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:28:06,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:28:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2068756551, now seen corresponding path program 1 times [2024-11-11 08:28:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:28:06,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953611133] [2024-11-11 08:28:06,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:28:06,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:28:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:28:06,901 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-11 08:28:06,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:28:06,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953611133] [2024-11-11 08:28:06,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953611133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:28:06,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:28:06,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-11 08:28:06,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745981798] [2024-11-11 08:28:06,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:28:06,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:28:06,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:28:06,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:28:06,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:28:06,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:06,905 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:28:06,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 08:28:06,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:06,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:06,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:06,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:06,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:07,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:07,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:07,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:07,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:07,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:07,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 08:28:07,342 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:28:07,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:28:07,343 INFO L85 PathProgramCache]: Analyzing trace with hash 494891520, now seen corresponding path program 1 times [2024-11-11 08:28:07,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:28:07,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752770664] [2024-11-11 08:28:07,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:28:07,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:28:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:28:07,516 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-11 08:28:07,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:28:07,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752770664] [2024-11-11 08:28:07,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752770664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:28:07,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:28:07,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 08:28:07,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467261635] [2024-11-11 08:28:07,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:28:07,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:28:07,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:28:07,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:28:07,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:28:07,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:07,520 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:28:07,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 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-11 08:28:07,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:07,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:07,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:07,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:07,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:07,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:07,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:07,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:07,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:07,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:07,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:07,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:07,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 08:28:07,927 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:28:07,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:28:07,928 INFO L85 PathProgramCache]: Analyzing trace with hash 494891521, now seen corresponding path program 1 times [2024-11-11 08:28:07,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:28:07,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762900614] [2024-11-11 08:28:07,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:28:07,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:28:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:28:08,380 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-11 08:28:08,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:28:08,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762900614] [2024-11-11 08:28:08,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762900614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:28:08,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:28:08,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 08:28:08,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084580855] [2024-11-11 08:28:08,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:28:08,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 08:28:08,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:28:08,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 08:28:08,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 08:28:08,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:08,385 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:28:08,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 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-11 08:28:08,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:08,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:08,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:08,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:08,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:08,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:08,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:08,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:08,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:28:08,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 08:28:08,889 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:28:08,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:28:08,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1861204073, now seen corresponding path program 1 times [2024-11-11 08:28:08,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:28:08,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275559126] [2024-11-11 08:28:08,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:28:08,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:28:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:28:10,254 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-11 08:28:10,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:28:10,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275559126] [2024-11-11 08:28:10,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275559126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:28:10,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:28:10,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 08:28:10,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723067485] [2024-11-11 08:28:10,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:28:10,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 08:28:10,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:28:10,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 08:28:10,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-11 08:28:10,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:10,259 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:28:10,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 08:28:10,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:10,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:10,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:10,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:10,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:10,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:10,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:28:10,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:10,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:10,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:28:10,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:28:10,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 08:28:10,814 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:28:10,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:28:10,815 INFO L85 PathProgramCache]: Analyzing trace with hash 750049702, now seen corresponding path program 1 times [2024-11-11 08:28:10,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:28:10,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022598652] [2024-11-11 08:28:10,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:28:10,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:28:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:28:13,902 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-11 08:28:13,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:28:13,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022598652] [2024-11-11 08:28:13,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022598652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:28:13,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:28:13,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-11 08:28:13,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205672995] [2024-11-11 08:28:13,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:28:13,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 08:28:13,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:28:13,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 08:28:13,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-11 08:28:13,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:13,909 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:28:13,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 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-11 08:28:13,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:13,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:13,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:13,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:13,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:13,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:13,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:28:13,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:28:13,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:15,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:15,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:15,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:15,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:15,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:15,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:15,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:28:15,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:28:15,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:28:15,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 08:28:15,222 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:28:15,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:28:15,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1845955818, now seen corresponding path program 1 times [2024-11-11 08:28:15,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:28:15,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050432005] [2024-11-11 08:28:15,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:28:15,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:28:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:28:17,785 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-11 08:28:17,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:28:17,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050432005] [2024-11-11 08:28:17,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050432005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:28:17,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:28:17,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 08:28:17,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385018827] [2024-11-11 08:28:17,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:28:17,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 08:28:17,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:28:17,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 08:28:17,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-11 08:28:17,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:17,789 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:28:17,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 08:28:17,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:17,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:17,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:17,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:17,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:17,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:17,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:28:17,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:28:17,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:28:17,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:18,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:18,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:18,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:28:18,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:28:18,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:28:18,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:28:18,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 08:28:18,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:28:18,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:28:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash -156280063, now seen corresponding path program 1 times [2024-11-11 08:28:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:28:18,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798248941] [2024-11-11 08:28:18,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:28:18,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:28:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:28:19,236 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-11 08:28:19,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:28:19,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798248941] [2024-11-11 08:28:19,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798248941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:28:19,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:28:19,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 08:28:19,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703808360] [2024-11-11 08:28:19,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:28:19,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 08:28:19,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:28:19,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 08:28:19,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 08:28:19,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:19,239 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:28:19,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11 08:28:19,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:19,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:19,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:19,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:19,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:19,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:19,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:28:19,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:28:19,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:28:19,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:28:19,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:19,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:19,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:19,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:19,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:19,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:19,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:19,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:28:19,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:28:19,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:28:19,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:28:19,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:28:19,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 08:28:19,432 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:28:19,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:28:19,432 INFO L85 PathProgramCache]: Analyzing trace with hash -811902022, now seen corresponding path program 1 times [2024-11-11 08:28:19,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:28:19,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838072339] [2024-11-11 08:28:19,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:28:19,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:28:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:28:19,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:28:19,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:28:19,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838072339] [2024-11-11 08:28:19,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838072339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:28:19,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:28:19,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 08:28:19,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286690289] [2024-11-11 08:28:19,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:28:19,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:28:19,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:28:19,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:28:19,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:28:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:19,561 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:28:19,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-11 08:28:19,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:19,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:19,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:19,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:19,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:19,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:19,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:28:19,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:28:19,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:28:19,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:28:19,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:28:19,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:28:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:28:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:28:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:28:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:28:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:20,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 08:28:20,567 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:28:20,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:28:20,567 INFO L85 PathProgramCache]: Analyzing trace with hash -180474182, now seen corresponding path program 1 times [2024-11-11 08:28:20,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:28:20,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461591169] [2024-11-11 08:28:20,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:28:20,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:28:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:28:20,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 08:28:20,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:28:20,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461591169] [2024-11-11 08:28:20,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461591169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:28:20,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:28:20,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 08:28:20,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369795702] [2024-11-11 08:28:20,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:28:20,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:28:20,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:28:20,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:28:20,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:28:20,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:20,815 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:28:20,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-11 08:28:20,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:20,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:20,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:20,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:20,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:20,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:20,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:28:20,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:28:20,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:28:20,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:28:20,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:28:20,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:20,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:21,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:28:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:28:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:28:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:28:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:28:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 08:28:21,032 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:28:21,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:28:21,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1393124767, now seen corresponding path program 1 times [2024-11-11 08:28:21,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:28:21,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347476207] [2024-11-11 08:28:21,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:28:21,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:28:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:28:21,230 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-11 08:28:21,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:28:21,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347476207] [2024-11-11 08:28:21,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347476207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:28:21,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:28:21,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 08:28:21,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559235445] [2024-11-11 08:28:21,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:28:21,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:28:21,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:28:21,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:28:21,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:28:21,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:21,233 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:28:21,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 08:28:21,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:21,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:28:21,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:28:21,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:28:21,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:28:21,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:28:21,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:21,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:28:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:28:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:28:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:28:21,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:28:21,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:21,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 08:28:21,430 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:28:21,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:28:21,430 INFO L85 PathProgramCache]: Analyzing trace with hash -113715809, now seen corresponding path program 1 times [2024-11-11 08:28:21,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:28:21,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296758854] [2024-11-11 08:28:21,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:28:21,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:28:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:28:23,525 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-11 08:28:23,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:28:23,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296758854] [2024-11-11 08:28:23,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296758854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:28:23,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:28:23,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-11 08:28:23,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068196197] [2024-11-11 08:28:23,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:28:23,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 08:28:23,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:28:23,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 08:28:23,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-11 08:28:23,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:23,527 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:28:23,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 13 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-11 08:28:23,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:23,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:23,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:23,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:23,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:23,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:23,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:28:23,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:28:23,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:28:23,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:28:23,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:28:23,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:23,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:23,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:23,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:28:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:28:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:28:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:28:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:28:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:28:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:28:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:28:24,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:28:24,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 08:28:24,296 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:28:24,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:28:24,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1619523975, now seen corresponding path program 1 times [2024-11-11 08:28:24,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:28:24,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155869657] [2024-11-11 08:28:24,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:28:24,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:28:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:28:27,423 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-11 08:28:27,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:28:27,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155869657] [2024-11-11 08:28:27,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155869657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:28:27,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791569472] [2024-11-11 08:28:27,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:28:27,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:28:27,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:28:27,426 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:28:27,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 08:28:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:28:27,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 2107 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-11 08:28:27,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:28:27,900 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-11 08:28:27,948 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-11 08:28:28,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:28:28,133 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 11 [2024-11-11 08:28:28,176 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-11 08:28:28,271 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 19 treesize of output 11 [2024-11-11 08:28:28,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:28:28,317 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-11 08:28:28,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:28:28,484 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 11 [2024-11-11 08:28:28,509 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-11 08:28:28,593 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 19 treesize of output 11 [2024-11-11 08:28:28,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:28:28,632 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-11 08:28:28,785 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-11 08:28:28,819 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-11 08:28:28,932 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-11 08:28:28,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:28:33,420 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_429 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_429 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-11 08:28:33,446 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_429 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_429 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-11 08:28:33,458 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_429 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_429 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2024-11-11 08:28:35,526 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_425) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_425) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2024-11-11 08:28:35,561 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse0 .cse1 v_ArrVal_425) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse5) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse6 .cse1 v_ArrVal_425) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse5) 4)))))) is different from false [2024-11-11 08:28:35,596 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse1 .cse2 v_ArrVal_425) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse5) 4)) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse6 .cse2 v_ArrVal_425) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse5) 4))))))))) is different from false [2024-11-11 08:28:37,641 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse1 .cse2 v_ArrVal_425) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 .cse2 v_ArrVal_425) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2024-11-11 08:28:38,136 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse1 .cse2 v_ArrVal_425) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse3) 4)))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 .cse2 v_ArrVal_425) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)))))) is different from false [2024-11-11 08:28:38,183 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse1 .cse2 v_ArrVal_425) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 .cse2 v_ArrVal_425) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)))))) is different from false [2024-11-11 08:28:39,104 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_420 Int) (v_ArrVal_418 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse8 .cse9 v_ArrVal_418))) (store (store .cse5 .cse6 v_ArrVal_420) .cse7 (+ (select .cse5 .cse7) 1)))))) (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse1 .cse2 v_ArrVal_425) .cse3 (+ 1 (select .cse1 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|))))) (forall ((v_ArrVal_420 Int) (v_ArrVal_418 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse8 .cse9 v_ArrVal_418))) (store (store .cse13 .cse6 v_ArrVal_420) .cse7 (+ (select .cse13 .cse7) 1)))))) (let ((.cse12 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse12 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse11 .cse2 v_ArrVal_425) .cse3 (+ 1 (select .cse11 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< (select .cse12 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|))))))) is different from false [2024-11-11 08:28:41,189 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select .cse9 .cse8))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|) (forall ((v_ArrVal_420 Int) (v_ArrVal_418 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_418))) (store (store .cse6 .cse7 v_ArrVal_420) .cse8 (+ (select .cse6 .cse8) 1)))))) (let ((.cse1 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 .cse5 v_ArrVal_425) .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse2) 4)) (select |c_#length| |c_~#queue~0.base|))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31| Int)) (or (forall ((v_ArrVal_420 Int) (v_ArrVal_418 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_418))) (store (store .cse13 .cse7 v_ArrVal_420) .cse8 (+ (select .cse13 .cse8) 1)))))) (let ((.cse12 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse12 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse11 .cse5 v_ArrVal_425) .cse2 (+ (select .cse11 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse2) 4)))) (< (select .cse12 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|))))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|)))))) is different from false [2024-11-11 08:28:43,261 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse6 .cse2)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|) (forall ((v_ArrVal_420 Int) (v_ArrVal_418 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|)) v_ArrVal_418))) (store (store .cse5 .cse4 v_ArrVal_420) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse3 .cse4 v_ArrVal_425) .cse2 (+ (select .cse3 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|) (forall ((v_ArrVal_420 Int) (v_ArrVal_418 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|)) v_ArrVal_418))) (store (store .cse9 .cse4 v_ArrVal_420) .cse2 (+ (select .cse9 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse8 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse8 .cse4 v_ArrVal_425) .cse2 (+ (select .cse8 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset|))))))))))) is different from false [2024-11-11 08:29:10,669 INFO L349 Elim1Store]: treesize reduction 306, result has 39.5 percent of original size [2024-11-11 08:29:10,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 412 treesize of output 358 [2024-11-11 08:29:10,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:29:10,724 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 352 treesize of output 348 [2024-11-11 08:29:10,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-11 08:29:10,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-11 08:29:10,909 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 42 treesize of output 34 [2024-11-11 08:29:10,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-11 08:29:11,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:29:11,051 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 169 treesize of output 167 [2024-11-11 08:29:11,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:29:11,650 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 164 treesize of output 136 [2024-11-11 08:29:11,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:11,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:11,903 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:29:11,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:11,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:11,943 INFO L349 Elim1Store]: treesize reduction 60, result has 53.1 percent of original size [2024-11-11 08:29:11,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 339 treesize of output 159 [2024-11-11 08:29:11,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:11,955 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:29:11,959 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 72 treesize of output 68 [2024-11-11 08:29:11,966 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:29:11,967 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 68 treesize of output 50 [2024-11-11 08:29:11,974 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:29:11,978 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 25 [2024-11-11 08:29:12,121 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-11 08:29:12,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791569472] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:29:12,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:29:12,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 21] total 56 [2024-11-11 08:29:12,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006273839] [2024-11-11 08:29:12,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:29:12,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-11 08:29:12,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:29:12,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-11 08:29:12,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1755, Unknown=52, NotChecked=1164, Total=3192 [2024-11-11 08:29:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:29:12,131 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:29:12,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.6842105263157894) internal successors, (210), 56 states have internal predecessors, (210), 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-11 08:29:12,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:12,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:29:12,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:12,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:12,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:12,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:12,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:29:12,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:29:12,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:29:12,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:29:12,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:29:12,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:12,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:12,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:12,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:29:12,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:29:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:29:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:29:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:29:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:29:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:29:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:29:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:19,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:29:19,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 08:29:19,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 08:29:19,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-11 08:29:19,393 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:29:19,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:29:19,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1144524775, now seen corresponding path program 1 times [2024-11-11 08:29:19,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:29:19,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130673770] [2024-11-11 08:29:19,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:29:19,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:29:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:29:19,790 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-11 08:29:19,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:29:19,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130673770] [2024-11-11 08:29:19,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130673770] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:29:19,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207230684] [2024-11-11 08:29:19,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:29:19,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:29:19,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:29:19,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:29:19,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 08:29:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:29:20,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 2158 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 08:29:20,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:29:20,902 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-11 08:29:20,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:29:21,292 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-11 08:29:21,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207230684] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:29:21,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:29:21,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-11-11 08:29:21,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961401145] [2024-11-11 08:29:21,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:29:21,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 08:29:21,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:29:21,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 08:29:21,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-11 08:29:21,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:29:21,295 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:29:21,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 21.272727272727273) internal successors, (234), 11 states have internal predecessors, (234), 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-11 08:29:21,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:21,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:29:21,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:21,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:21,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:21,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:21,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:29:21,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:29:21,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:29:21,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:29:21,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:29:21,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:21,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:21,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:21,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:29:21,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-11 08:29:21,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:29:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:29:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:29:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:29:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:29:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:29:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:29:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:29:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:29:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:29:24,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 08:29:25,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 08:29:25,098 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:29:25,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:29:25,099 INFO L85 PathProgramCache]: Analyzing trace with hash -352406591, now seen corresponding path program 1 times [2024-11-11 08:29:25,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:29:25,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796986849] [2024-11-11 08:29:25,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:29:25,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:29:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:29:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 127 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-11 08:29:28,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:29:28,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796986849] [2024-11-11 08:29:28,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796986849] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:29:28,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518923396] [2024-11-11 08:29:28,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:29:28,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:29:28,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:29:28,401 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:29:28,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 08:29:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:29:28,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 2724 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-11 08:29:28,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:29:29,506 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-11 08:29:29,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:29,545 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-11 08:29:29,667 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-11 08:29:29,771 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 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-11 08:29:30,001 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-11 08:29:30,002 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 41 treesize of output 24 [2024-11-11 08:29:30,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 08:29:30,127 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 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-11 08:29:30,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:30,186 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-11 08:29:30,320 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-11 08:29:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 127 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-11 08:29:30,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:29:31,547 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_759 Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_757 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_751) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 1) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_757) .cse2 v_ArrVal_759)) |c_~#stored_elements~0.base| v_ArrVal_760) |c_~#queue~0.base|) .cse1))) (not (= (select .cse0 .cse1) 400)) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)))) is different from false [2024-11-11 08:29:31,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:29:31,567 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 109 treesize of output 79 [2024-11-11 08:29:31,770 INFO L349 Elim1Store]: treesize reduction 192, result has 41.8 percent of original size [2024-11-11 08:29:31,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 151 treesize of output 243 [2024-11-11 08:29:31,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:29:31,824 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 140 treesize of output 152 [2024-11-11 08:29:31,837 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-11 08:29:31,850 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 36 treesize of output 28 [2024-11-11 08:29:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 124 proven. 29 refuted. 0 times theorem prover too weak. 36 trivial. 2 not checked. [2024-11-11 08:29:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518923396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:29:32,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:29:32,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 18] total 43 [2024-11-11 08:29:32,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74984304] [2024-11-11 08:29:32,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:29:32,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-11 08:29:32,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:29:32,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-11 08:29:32,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1477, Unknown=25, NotChecked=82, Total=1892 [2024-11-11 08:29:32,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:29:32,222 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:29:32,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 9.181818181818182) internal successors, (404), 43 states have internal predecessors, (404), 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-11 08:29:32,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:32,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:29:32,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:32,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:32,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:32,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:32,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:29:32,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:29:32,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:29:32,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:29:32,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:29:32,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:32,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:32,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:32,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:29:32,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:29:32,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:29:32,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:29:37,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:37,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:29:37,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:37,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:29:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:29:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:29:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:29:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:29:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:29:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:29:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:29:37,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 08:29:37,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 08:29:37,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-11 08:29:37,612 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:29:37,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:29:37,612 INFO L85 PathProgramCache]: Analyzing trace with hash -657249502, now seen corresponding path program 2 times [2024-11-11 08:29:37,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:29:37,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508393016] [2024-11-11 08:29:37,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:29:37,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:29:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:29:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 100 proven. 10 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-11 08:29:43,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:29:43,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508393016] [2024-11-11 08:29:43,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508393016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:29:43,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248338847] [2024-11-11 08:29:43,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 08:29:43,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:29:43,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:29:43,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:29:43,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 08:29:44,236 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 08:29:44,236 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 08:29:44,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 2914 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-11-11 08:29:44,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:29:44,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:44,327 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-11 08:29:44,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:44,341 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-11 08:29:44,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:44,353 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-11 08:29:44,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:44,471 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-11 08:29:44,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:44,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-11 08:29:44,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:44,529 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-11 08:29:44,553 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-11 08:29:44,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:44,697 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-11 08:29:44,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:44,724 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-11 08:29:44,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:44,775 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-11 08:29:44,798 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-11 08:29:45,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:45,313 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-11 08:29:45,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:45,373 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-11 08:29:45,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:45,546 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-11 08:29:45,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:45,582 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-11 08:29:45,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:45,627 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-11 08:29:45,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:45,659 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 31 treesize of output 11 [2024-11-11 08:29:45,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:45,929 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-11 08:29:45,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:45,966 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-11 08:29:46,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:46,126 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-11 08:29:46,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:46,162 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-11 08:29:46,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:46,207 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-11 08:29:46,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:46,236 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 31 treesize of output 11 [2024-11-11 08:29:46,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:46,498 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-11 08:29:46,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:46,552 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-11 08:29:46,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:46,729 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-11 08:29:46,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:46,778 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-11 08:29:46,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:46,834 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-11 08:29:46,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:46,857 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 31 treesize of output 11 [2024-11-11 08:29:47,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:47,198 INFO L349 Elim1Store]: treesize reduction 31, result has 29.5 percent of original size [2024-11-11 08:29:47,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 43 [2024-11-11 08:29:47,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:29:47,428 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 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-11 08:29:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 151 proven. 154 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 08:29:47,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:29:47,714 WARN L851 $PredicateComparison]: unable to prove that (and (<= 1 |c_t2Thread1of1ForFork1_dequeue_~x~0#1|) (forall ((v_ArrVal_1053 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) 0))) is different from false [2024-11-11 08:29:48,389 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_ArrVal_1050))) (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)) 400)) (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0)))) is different from false [2024-11-11 08:29:48,479 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1050))) (let ((.cse1 (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|))) (or (not (= 400 (select (select (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)))) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0))))) is different from false [2024-11-11 08:29:48,553 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (v_ArrVal_1047 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1047))) (let ((.cse0 (store .cse2 |c_~#queue~0.base| v_ArrVal_1050))) (let ((.cse1 (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|))) (or (not (= 400 (select (select (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)))) (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0)))))) is different from false [2024-11-11 08:29:48,663 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1050))) (let ((.cse1 (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|))) (or (not (= 400 (select (select (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)))) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0))))) is different from false [2024-11-11 08:29:48,688 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_44| Int)) (or (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (forall ((|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1050))) (let ((.cse0 (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |t1Thread1of1ForFork0_~value~0#1|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0) (not (= 400 (select (select (store .cse1 |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)))))))))) is different from false [2024-11-11 08:29:48,724 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600))))))) is different from false [2024-11-11 08:29:48,766 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_ArrVal_1044))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)))) (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0))))) is different from false [2024-11-11 08:29:48,932 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600))))))) is different from false [2024-11-11 08:29:49,041 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1041))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)))) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0))))) is different from false [2024-11-11 08:29:49,251 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 12)) 0) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600))))))) is different from false [2024-11-11 08:29:49,299 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_45| Int)) (or (forall ((|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_45| 4) 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |v_t1Thread1of1ForFork0_~i~0#1_45| 1)) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 12)) 0) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600))))))) (< |v_t1Thread1of1ForFork0_~i~0#1_45| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-11-11 08:29:49,354 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_45| Int) (|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|v_t1Thread1of1ForFork0_~value~0#1_36| Int) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_45| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_36|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)))) (< |v_t1Thread1of1ForFork0_~i~0#1_45| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |v_t1Thread1of1ForFork0_~i~0#1_45| 1)) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 12)) 0)))) is different from false [2024-11-11 08:29:49,399 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_45| Int) (|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|v_t1Thread1of1ForFork0_~value~0#1_36| Int) (v_ArrVal_1038 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_ArrVal_1038))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_45| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_36|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_45| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (= 0 (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 12))) (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |v_t1Thread1of1ForFork0_~i~0#1_45| 1)) (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)))))))) is different from false [2024-11-11 08:29:49,561 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_45| Int) (|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|v_t1Thread1of1ForFork0_~value~0#1_36| Int) (v_ArrVal_1038 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1038) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_45| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_36|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_45| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |v_t1Thread1of1ForFork0_~i~0#1_45| 1)) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600))))))) is different from false [2024-11-11 08:29:49,754 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_45| Int) (|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|v_t1Thread1of1ForFork0_~value~0#1_36| Int) (v_ArrVal_1038 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (v_ArrVal_1035 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1035))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1038) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_45| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_36|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_45| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |v_t1Thread1of1ForFork0_~i~0#1_45| 1)) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 12)) 0) (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)))))))) is different from false [2024-11-11 08:29:50,126 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_45| Int) (|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|v_t1Thread1of1ForFork0_~value~0#1_36| Int) (v_ArrVal_1038 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1038) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_45| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_36|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_45| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |v_t1Thread1of1ForFork0_~i~0#1_45| 1)) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)))) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0)))) is different from false [2024-11-11 08:29:50,234 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_46| Int)) (or (forall ((|v_t1Thread1of1ForFork0_~i~0#1_45| Int) (|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|v_t1Thread1of1ForFork0_~value~0#1_36| Int) (v_ArrVal_1038 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1038) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |v_t1Thread1of1ForFork0_~i~0#1_46| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_45| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_36|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |v_t1Thread1of1ForFork0_~i~0#1_45| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_45| (+ |v_t1Thread1of1ForFork0_~i~0#1_46| 1)) (not (= (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)) 400)) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0)))) (< |v_t1Thread1of1ForFork0_~i~0#1_46| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-11-11 08:29:50,371 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_45| Int) (|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|v_t1Thread1of1ForFork0_~i~0#1_46| Int) (|v_t1Thread1of1ForFork0_~value~0#1_36| Int) (v_ArrVal_1038 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1038) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |v_t1Thread1of1ForFork0_~i~0#1_46| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_45| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_36|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_46| (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |v_t1Thread1of1ForFork0_~i~0#1_45| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_45| (+ |v_t1Thread1of1ForFork0_~i~0#1_46| 1)) (not (= (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)) 400)) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0)))) is different from false [2024-11-11 08:29:50,512 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_45| Int) (|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|v_t1Thread1of1ForFork0_~i~0#1_46| Int) (|v_t1Thread1of1ForFork0_~value~0#1_36| Int) (v_ArrVal_1038 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1038) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |v_t1Thread1of1ForFork0_~i~0#1_46| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_45| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_36|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |v_t1Thread1of1ForFork0_~i~0#1_45| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_46| (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (< |v_t1Thread1of1ForFork0_~i~0#1_45| (+ |v_t1Thread1of1ForFork0_~i~0#1_46| 1)) (not (= (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)) 400)) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0)))) is different from false [2024-11-11 08:29:50,574 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_38| Int) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_45| Int) (|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|v_t1Thread1of1ForFork0_~i~0#1_46| Int) (|v_t1Thread1of1ForFork0_~value~0#1_36| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int)) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1038) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |v_t1Thread1of1ForFork0_~i~0#1_46| 4)) |v_t1Thread1of1ForFork0_~value~0#1_38|)) |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_45| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_36|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |v_t1Thread1of1ForFork0_~i~0#1_45| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_46| (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (< |v_t1Thread1of1ForFork0_~i~0#1_45| (+ |v_t1Thread1of1ForFork0_~i~0#1_46| 1)) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600))))))) is different from false [2024-11-11 08:29:50,676 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1032 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_38| Int) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_45| Int) (|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|v_t1Thread1of1ForFork0_~i~0#1_46| Int) (|v_t1Thread1of1ForFork0_~value~0#1_36| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_ArrVal_1032))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1038) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |v_t1Thread1of1ForFork0_~i~0#1_46| 4)) |v_t1Thread1of1ForFork0_~value~0#1_38|)) |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_45| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_36|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |v_t1Thread1of1ForFork0_~i~0#1_45| 1)) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (not (= (select (select (store (store .cse0 |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)) 400)) (< |v_t1Thread1of1ForFork0_~i~0#1_46| (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (< |v_t1Thread1of1ForFork0_~i~0#1_45| (+ |v_t1Thread1of1ForFork0_~i~0#1_46| 1)))))) is different from false [2024-11-11 08:29:50,984 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1032 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_38| Int) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_45| Int) (|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|v_t1Thread1of1ForFork0_~i~0#1_46| Int) (|v_t1Thread1of1ForFork0_~value~0#1_36| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int)) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1032) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1038) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |v_t1Thread1of1ForFork0_~i~0#1_46| 4)) |v_t1Thread1of1ForFork0_~value~0#1_38|)) |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_45| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_36|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |v_t1Thread1of1ForFork0_~i~0#1_45| 1)) (not (= (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)) 400)) (< |v_t1Thread1of1ForFork0_~i~0#1_46| (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (< |v_t1Thread1of1ForFork0_~i~0#1_45| (+ |v_t1Thread1of1ForFork0_~i~0#1_46| 1)) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0)))) is different from false [2024-11-11 08:29:51,107 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1032 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_38| Int) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_45| Int) (|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|v_t1Thread1of1ForFork0_~i~0#1_46| Int) (|v_t1Thread1of1ForFork0_~value~0#1_36| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int)) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1032) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1038) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |v_t1Thread1of1ForFork0_~i~0#1_46| 4)) |v_t1Thread1of1ForFork0_~value~0#1_38|)) |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_45| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_36|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |v_t1Thread1of1ForFork0_~i~0#1_45| 1)) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)))) (< |v_t1Thread1of1ForFork0_~i~0#1_46| 3) (< |v_t1Thread1of1ForFork0_~i~0#1_45| (+ |v_t1Thread1of1ForFork0_~i~0#1_46| 1))))) is different from false [2024-11-11 08:29:51,298 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1032 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_38| Int) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_45| Int) (|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|v_t1Thread1of1ForFork0_~i~0#1_46| Int) (|v_t1Thread1of1ForFork0_~value~0#1_36| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (v_ArrVal_1028 Int)) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| v_ArrVal_1028)) |c_~#queue~0.base| v_ArrVal_1032) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1038) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |v_t1Thread1of1ForFork0_~i~0#1_46| 4)) |v_t1Thread1of1ForFork0_~value~0#1_38|)) |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_45| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_36|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)))) (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |v_t1Thread1of1ForFork0_~i~0#1_45| 1)) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_46| 3) (< |v_t1Thread1of1ForFork0_~i~0#1_45| (+ |v_t1Thread1of1ForFork0_~i~0#1_46| 1))))) is different from false [2024-11-11 08:29:51,395 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1032 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_38| Int) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_45| Int) (|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|v_t1Thread1of1ForFork0_~i~0#1_46| Int) (|v_t1Thread1of1ForFork0_~value~0#1_36| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (v_ArrVal_1028 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_ArrVal_1027))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| v_ArrVal_1028)) |c_~#queue~0.base| v_ArrVal_1032) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1038) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |v_t1Thread1of1ForFork0_~i~0#1_46| 4)) |v_t1Thread1of1ForFork0_~value~0#1_38|)) |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_45| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_36|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)))) (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |v_t1Thread1of1ForFork0_~i~0#1_45| 1)) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_46| 3) (< |v_t1Thread1of1ForFork0_~i~0#1_45| (+ |v_t1Thread1of1ForFork0_~i~0#1_46| 1)))))) is different from false [2024-11-11 08:29:51,784 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1032 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_38| Int) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_45| Int) (|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|v_t1Thread1of1ForFork0_~i~0#1_46| Int) (|v_t1Thread1of1ForFork0_~value~0#1_36| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_144| Int) (v_ArrVal_1028 Int)) (let ((.cse0 (store |c_#memory_int| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_144| v_ArrVal_1027))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| v_ArrVal_1028)) |c_~#queue~0.base| v_ArrVal_1032) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1038) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |v_t1Thread1of1ForFork0_~i~0#1_46| 4)) |v_t1Thread1of1ForFork0_~value~0#1_38|)) |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_45| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_36|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_144| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |v_t1Thread1of1ForFork0_~i~0#1_45| 1)) (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)))) (< |v_t1Thread1of1ForFork0_~i~0#1_46| 3) (< |v_t1Thread1of1ForFork0_~i~0#1_45| (+ |v_t1Thread1of1ForFork0_~i~0#1_46| 1)) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0))))) is different from false [2024-11-11 08:29:52,144 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_~q#1.offset| Int) (v_ArrVal_1024 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1032 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_38| Int) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_45| Int) (|v_t1Thread1of1ForFork0_~value~0#1_34| Int) (|v_t1Thread1of1ForFork0_~i~0#1_46| Int) (|v_t1Thread1of1ForFork0_~value~0#1_36| Int) (|v_t1Thread1of1ForFork0_~i~0#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_144| Int) (v_ArrVal_1028 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| v_ArrVal_1024) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_144| v_ArrVal_1027))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| v_ArrVal_1028)) |c_~#queue~0.base| v_ArrVal_1032) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_1038) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |v_t1Thread1of1ForFork0_~i~0#1_46| 4)) |v_t1Thread1of1ForFork0_~value~0#1_38|)) |c_~#queue~0.base| v_ArrVal_1044) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_45| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_36|)) |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_44| 4) 4) |v_t1Thread1of1ForFork0_~value~0#1_34|))) (or (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_144| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_44| (+ |v_t1Thread1of1ForFork0_~i~0#1_45| 1)) (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_ArrVal_1050) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ |t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)))) (< |v_t1Thread1of1ForFork0_~i~0#1_46| 3) (< |v_t1Thread1of1ForFork0_~i~0#1_45| (+ |v_t1Thread1of1ForFork0_~i~0#1_46| 1)) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_1053) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0))))) is different from false [2024-11-11 08:29:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 166 not checked. [2024-11-11 08:29:52,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248338847] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:29:52,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:29:52,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 31, 39] total 87 [2024-11-11 08:29:52,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945142794] [2024-11-11 08:29:52,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:29:52,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2024-11-11 08:29:52,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:29:52,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2024-11-11 08:29:52,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=3279, Unknown=53, NotChecked=4004, Total=7656 [2024-11-11 08:29:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:29:52,278 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:29:52,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 5.261363636363637) internal successors, (463), 87 states have internal predecessors, (463), 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-11 08:29:52,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:52,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:29:52,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:52,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:52,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:52,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:52,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:29:52,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:29:52,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:29:52,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:29:52,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:29:52,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:52,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:52,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:29:52,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:29:52,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:29:52,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:29:52,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-11 08:29:52,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:30:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:30:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:30:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:30:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:30:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:30:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:30:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:30:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:30:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:30:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 08:30:00,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-11 08:30:00,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 08:30:01,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:30:01,025 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:30:01,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:30:01,026 INFO L85 PathProgramCache]: Analyzing trace with hash -53455040, now seen corresponding path program 1 times [2024-11-11 08:30:01,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:30:01,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828487301] [2024-11-11 08:30:01,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:30:01,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:30:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:30:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-11 08:30:01,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:30:01,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828487301] [2024-11-11 08:30:01,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828487301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:30:01,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:30:01,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 08:30:01,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002063084] [2024-11-11 08:30:01,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:30:01,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:30:01,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:30:01,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:30:01,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:30:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:30:01,167 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:30:01,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-11 08:30:01,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:01,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:30:01,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:01,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:01,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:01,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:01,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:30:01,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:30:01,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:30:01,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:30:01,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:30:01,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:01,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:01,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:01,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:30:01,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:30:01,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:30:01,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-11 08:30:01,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-11-11 08:30:01,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:30:04,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:04,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:30:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:30:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:30:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:30:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:30:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:30:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:30:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:30:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:30:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 08:30:04,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-11-11 08:30:04,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:04,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 08:30:04,159 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:30:04,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:30:04,159 INFO L85 PathProgramCache]: Analyzing trace with hash 94752938, now seen corresponding path program 1 times [2024-11-11 08:30:04,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:30:04,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518787448] [2024-11-11 08:30:04,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:30:04,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:30:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:30:09,863 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 08:30:09,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:30:09,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518787448] [2024-11-11 08:30:09,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518787448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:30:09,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574754178] [2024-11-11 08:30:09,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:30:09,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:30:09,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:30:09,865 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:30:09,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 08:30:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:30:10,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 2344 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-11-11 08:30:10,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:30:10,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-11 08:30:10,380 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 22 [2024-11-11 08:30:10,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:30:10,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-11 08:30:10,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:30:10,723 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:30:10,744 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-11-11 08:30:10,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2024-11-11 08:30:10,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:30:10,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:30:10,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-11 08:30:10,904 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 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-11 08:30:10,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:30:10,963 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 20 [2024-11-11 08:30:11,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:30:11,144 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:30:11,163 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-11-11 08:30:11,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2024-11-11 08:30:11,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:30:11,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:30:11,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-11 08:30:11,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:30:11,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 27 [2024-11-11 08:30:11,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:30:11,353 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 20 [2024-11-11 08:30:11,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:30:11,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:30:11,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-11 08:30:11,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:30:11,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2024-11-11 08:30:11,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:30:11,933 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:30:11,951 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-11-11 08:30:11,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2024-11-11 08:30:11,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:30:11,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:30:11,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-11 08:30:12,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:30:12,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2024-11-11 08:30:12,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:30:12,080 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 18 treesize of output 13 [2024-11-11 08:30:12,189 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 29 treesize of output 13 [2024-11-11 08:30:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 08:30:12,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:30:12,353 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1313 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1313) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400))) is different from false [2024-11-11 08:30:16,365 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1309 Int) (v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1311 Int) (v_ArrVal_1302 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1302)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1304) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (let ((.cse2 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1309) .cse3 v_ArrVal_1311)) |c_~#stored_elements~0.base| v_ArrVal_1313) |c_~#queue~0.base|) .cse2)))) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1302) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|))))) is different from false [2024-11-11 08:30:16,586 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1309 Int) (v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1300 Int) (v_ArrVal_1311 Int) (v_ArrVal_1302 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1300) .cse5 v_ArrVal_1302)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1304) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (let ((.cse2 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1309) .cse3 v_ArrVal_1311)) |c_~#stored_elements~0.base| v_ArrVal_1313) |c_~#queue~0.base|) .cse2)))) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1302)))))) is different from false [2024-11-11 08:30:16,624 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1309 Int) (v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1300 Int) (v_ArrVal_1311 Int) (v_ArrVal_1302 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1300) .cse1 v_ArrVal_1302)))) (let ((.cse3 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1304) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1302) (not (= 400 (let ((.cse4 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1309) .cse5 v_ArrVal_1311)) |c_~#stored_elements~0.base| v_ArrVal_1313) |c_~#queue~0.base|) .cse4)))) (< (select .cse3 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)))))) is different from false [2024-11-11 08:30:16,652 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (forall ((v_ArrVal_1309 Int) (v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1300 Int) (v_ArrVal_1311 Int) (v_ArrVal_1302 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1300) .cse1 v_ArrVal_1302)))) (let ((.cse4 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1304) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse2 .cse1) 1) v_ArrVal_1302) (not (= 400 (let ((.cse5 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1309) .cse6 v_ArrVal_1311)) |c_~#stored_elements~0.base| v_ArrVal_1313) |c_~#queue~0.base|) .cse5)))) (< (select .cse4 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|))))))))) is different from false [2024-11-11 08:30:21,437 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1309 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1298 (Array Int Int)) (v_ArrVal_1300 Int) (v_ArrVal_1311 Int) (v_ArrVal_1302 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1298) |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1300) .cse1 v_ArrVal_1302)) |c_~#stored_elements~0.base| v_ArrVal_1304) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (not (= 400 (let ((.cse3 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse0 .cse3 (+ (select .cse0 .cse3) 1)) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1309) .cse1 v_ArrVal_1311)) |c_~#stored_elements~0.base| v_ArrVal_1313) |c_~#queue~0.base|) .cse3)))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1302)))))) is different from false [2024-11-11 08:30:21,724 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1309 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1298 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_1300 Int) (v_ArrVal_1311 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1302 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))))) (let ((.cse0 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1298) |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse8 v_ArrVal_1300) .cse1 v_ArrVal_1302)) |c_~#stored_elements~0.base| v_ArrVal_1304) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1302) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|) (not (= 400 (let ((.cse7 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse3 .cse7 (+ (select .cse3 .cse7) 1)) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse8 v_ArrVal_1309) .cse1 v_ArrVal_1311)) |c_~#stored_elements~0.base| v_ArrVal_1313) |c_~#queue~0.base|) .cse7))))))))))) is different from false [2024-11-11 08:30:21,812 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1309 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1298 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_1295 Int) (v_ArrVal_1300 Int) (v_ArrVal_1311 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1302 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1295) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))))) (let ((.cse8 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1298) |c_~#queue~0.base|))) (let ((.cse2 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_1300) .cse3 v_ArrVal_1302)) |c_~#stored_elements~0.base| v_ArrVal_1304) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1302) (not (= (let ((.cse6 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse7 v_ArrVal_1309) .cse3 v_ArrVal_1311)) |c_~#stored_elements~0.base| v_ArrVal_1313) |c_~#queue~0.base|) .cse6)) 400)) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)))))))) is different from false [2024-11-11 08:30:21,891 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1309 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1298 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_1295 Int) (v_ArrVal_1294 Int) (v_ArrVal_1300 Int) (v_ArrVal_1311 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1302 Int)) (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1294)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1295) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1298) |c_~#queue~0.base|))) (let ((.cse8 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_1300) .cse1 v_ArrVal_1302)) |c_~#stored_elements~0.base| v_ArrVal_1304) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (not (= (let ((.cse4 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse2 .cse4 (+ (select .cse2 .cse4) 1)) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse5 v_ArrVal_1309) .cse1 v_ArrVal_1311)) |c_~#stored_elements~0.base| v_ArrVal_1313) |c_~#queue~0.base|) .cse4)) 400)) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1302)))))))) is different from false [2024-11-11 08:30:21,951 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_96| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_96|) (forall ((v_ArrVal_1309 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1313 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1298 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_1295 Int) (v_ArrVal_1294 Int) (v_ArrVal_1300 Int) (v_ArrVal_1311 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_1302 Int)) (let ((.cse8 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_96|)) v_ArrVal_1294))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1295) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))))) (let ((.cse9 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1298) |c_~#queue~0.base|))) (let ((.cse2 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_1300) .cse3 v_ArrVal_1302)) |c_~#stored_elements~0.base| v_ArrVal_1304) |c_~#queue~0.base|))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_1302) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) (not (= 400 (let ((.cse6 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse4 .cse6 (+ (select .cse4 .cse6) 1)) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse7 v_ArrVal_1309) .cse3 v_ArrVal_1311)) |c_~#stored_elements~0.base| v_ArrVal_1313) |c_~#queue~0.base|) .cse6)))) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|) (< (select .cse9 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|))))))))))) is different from false [2024-11-11 08:30:51,604 INFO L349 Elim1Store]: treesize reduction 402, result has 38.9 percent of original size [2024-11-11 08:30:51,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 984 treesize of output 821 [2024-11-11 08:30:51,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:30:51,666 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 711 treesize of output 703 [2024-11-11 08:30:51,690 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 68 treesize of output 64 [2024-11-11 08:30:51,709 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 42 treesize of output 34 [2024-11-11 08:30:51,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-11 08:30:51,903 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 39 treesize of output 31 [2024-11-11 08:30:51,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-11 08:30:52,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:30:52,080 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 194 [2024-11-11 08:30:52,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:30:52,371 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 185 [2024-11-11 08:30:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 08:30:53,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574754178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:30:53,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:30:53,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 31] total 77 [2024-11-11 08:30:53,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770958597] [2024-11-11 08:30:53,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:30:53,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2024-11-11 08:30:53,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:30:53,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2024-11-11 08:30:53,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=585, Invalid=3919, Unknown=92, NotChecked=1410, Total=6006 [2024-11-11 08:30:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:30:53,157 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:30:53,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 3.8333333333333335) internal successors, (299), 77 states have internal predecessors, (299), 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-11 08:30:53,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:53,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:30:53,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:53,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:53,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:53,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:53,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:30:53,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:30:53,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:30:53,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:30:53,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:30:53,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:53,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:53,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:53,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:30:53,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:30:53,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:30:53,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-11 08:30:53,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-11-11 08:30:53,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:30:53,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:31:10,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 08:31:15,672 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (not (= (select .cse0 1600) 400)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_1309 Int) (v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1311 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1309) .cse1 v_ArrVal_1311)) |c_~#stored_elements~0.base| v_ArrVal_1313) |c_~#queue~0.base|) .cse2)))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)))) (forall ((v_ArrVal_1309 Int) (v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1311 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1309) .cse4 v_ArrVal_1311)) |c_~#stored_elements~0.base| v_ArrVal_1313) |c_~#queue~0.base|) .cse2))) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_90|)))))) is different from false [2024-11-11 08:31:16,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:31:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:31:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:31:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:31:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:31:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:31:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:31:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:31:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:31:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:31:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:31:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:31:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:31:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:31:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:31:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:31:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:31:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 08:31:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-11-11 08:31:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:31:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-11 08:31:16,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 08:31:16,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:31:16,259 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:31:16,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:31:16,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1194661197, now seen corresponding path program 1 times [2024-11-11 08:31:16,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:31:16,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213154869] [2024-11-11 08:31:16,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:31:16,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:31:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:31:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 08:31:21,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:31:21,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213154869] [2024-11-11 08:31:21,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213154869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:31:21,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010105122] [2024-11-11 08:31:21,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:31:21,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:31:21,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:31:21,473 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:31:21,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 08:31:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:31:21,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 2351 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-11 08:31:21,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:31:21,941 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-11 08:31:22,007 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-11 08:31:22,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:31:22,258 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 11 [2024-11-11 08:31:22,305 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-11 08:31:22,415 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 19 treesize of output 11 [2024-11-11 08:31:22,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:31:22,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-11 08:31:22,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:31:22,717 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 11 [2024-11-11 08:31:22,751 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-11 08:31:22,880 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 19 treesize of output 11 [2024-11-11 08:31:22,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:31:22,953 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-11 08:31:23,302 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-11 08:31:23,372 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-11 08:31:23,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:31:23,604 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 11 [2024-11-11 08:31:23,639 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-11 08:31:23,763 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 19 treesize of output 11 [2024-11-11 08:31:23,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:31:23,840 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-11 08:31:24,060 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-11 08:31:24,108 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-11 08:31:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 08:31:24,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:31:29,399 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1477 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1477 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2024-11-11 08:31:29,418 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1477 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1477 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2024-11-11 08:31:29,433 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1477 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1))) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1477 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1))))))) is different from false [2024-11-11 08:31:29,461 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1474) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1474) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2024-11-11 08:31:31,493 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse0 .cse1 v_ArrVal_1474) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse6 .cse1 v_ArrVal_1474) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-11 08:32:28,352 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse1 .cse6)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_1474) .cse6 (+ (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse6) 4)) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse7) .cse8 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_1474) .cse6 (+ (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse7) .cse8 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse6) 4))))))))) is different from false [2024-11-11 08:32:28,898 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_1474) .cse1 (+ (select (store (store (store .cse0 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4))))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse6 .cse2 .cse7) .cse8 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_1474) .cse1 (+ (select (store (store (store .cse6 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse7) .cse8 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2024-11-11 08:32:28,950 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 .cse4) .cse5 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse6 v_ArrVal_1474) .cse1 (+ (select (store (store (store .cse0 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse4) .cse5 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse8 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse7 .cse3 .cse8) .cse9 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse6 v_ArrVal_1474) .cse1 (+ (select (store (store (store .cse7 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse8) .cse9 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))))) is different from false [2024-11-11 08:32:29,841 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse10 (+ (select .cse7 .cse9) 1))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_1465) .cse9 .cse10)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_1474) .cse6 (+ (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (< (select .cse1 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_1465) .cse9 .cse10)))) (let ((.cse11 (select (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (< (select .cse11 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse11 .cse2 .cse13) .cse14 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_1474) .cse6 (+ (select (store (store (store .cse11 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse13) .cse14 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))))) is different from false [2024-11-11 08:32:32,572 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse11 (select .cse10 .cse9))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int)) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse8 v_ArrVal_1465) .cse9 (+ (select .cse7 .cse9) 1)))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_1 Int)) (<= (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 .cse4) .cse5 v_subst_1) .cse6 v_ArrVal_1474) .cse1 (+ (select (store (store (store .cse0 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse4) .cse5 v_subst_1) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int)) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse16 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse16 .cse8 v_ArrVal_1465) .cse9 (+ (select .cse16 .cse9) 1)))))) (let ((.cse12 (select (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_2 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse12 .cse3 .cse14) .cse15 v_subst_2) .cse6 v_ArrVal_1474) .cse1 (+ (select (store (store (store .cse12 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse14) .cse15 v_subst_2) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4)))))))) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|)))))) is different from false [2024-11-11 08:33:51,777 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1463 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse6 v_ArrVal_1465) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_2 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse3 .cse4) .cse5 v_subst_2) .cse6 v_ArrVal_1474) .cse1 (+ (select (store (store (store .cse2 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse4) .cse5 v_subst_2) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4)))) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|))))))) (forall ((v_ArrVal_1463 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int)) (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (or (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse12 .cse6 v_ArrVal_1465) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_1 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse9 .cse3 .cse10) .cse11 v_subst_1) .cse6 v_ArrVal_1474) .cse1 (+ (select (store (store (store .cse9 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse10) .cse11 v_subst_1) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))))))))) is different from false [2024-11-11 08:33:51,912 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_1463 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int)) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse8 .cse7 v_ArrVal_1465) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_2 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse5 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse3 .cse4 .cse5) .cse6 v_subst_2) .cse7 v_ArrVal_1474) .cse1 (+ (select (store (store (store .cse3 .cse7 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse5) .cse6 v_subst_2) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4)))) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|))))))) (forall ((v_ArrVal_1463 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int)) (let ((.cse9 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (or (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse10 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse13 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse13 .cse7 v_ArrVal_1465) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_1 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse11 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse10 .cse4 .cse11) .cse12 v_subst_1) .cse7 v_ArrVal_1474) .cse1 (+ (select (store (store (store .cse10 .cse7 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse11) .cse12 v_subst_1) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|))))))))) is different from false [2024-11-11 08:33:51,971 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse15 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse14 .cse15 (+ (select .cse14 .cse15) 1)))))) (and (forall ((v_ArrVal_1463 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int)) (let ((.cse8 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse6 v_ArrVal_1465) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_1 Int)) (<= (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 .cse4) .cse5 v_subst_1) .cse6 v_ArrVal_1474) .cse1 (+ (select (store (store (store .cse0 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse4) .cse5 v_subst_1) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|)))) (forall ((v_ArrVal_1463 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int)) (let ((.cse9 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (or (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse10 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse13 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse13 .cse6 v_ArrVal_1465) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_2 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse11 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse10 .cse3 .cse11) .cse12 v_subst_2) .cse6 v_ArrVal_1474) .cse1 (+ (select (store (store (store .cse10 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse11) .cse12 v_subst_2) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4)))))))))))) is different from false [2024-11-11 08:33:52,178 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse10 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse12 (+ (select .cse9 .cse11) 1))) (and (forall ((v_ArrVal_1460 Int) (v_ArrVal_1463 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_1460) .cse11 .cse12)))) (let ((.cse8 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse5 v_ArrVal_1465) .cse6 (+ (select .cse7 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_2 Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_subst_2) .cse5 v_ArrVal_1474) .cse6 (+ (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 v_subst_2) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (< (select .cse1 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))) (< (select .cse8 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|))))) (forall ((v_ArrVal_1460 Int) (v_ArrVal_1463 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int)) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_1460) .cse11 .cse12)))) (let ((.cse18 (select (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse14 (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse17 (store .cse18 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse17 .cse5 v_ArrVal_1465) .cse6 (+ (select .cse17 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_1 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse15 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse14 .cse2 .cse15) .cse16 v_subst_1) .cse5 v_ArrVal_1474) .cse6 (+ (select (store (store (store .cse14 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse15) .cse16 v_subst_1) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse6) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse14 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))) (< (select .cse18 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|)))))))) is different from false [2024-11-11 08:33:52,399 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse10 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1460 Int) (v_ArrVal_1463 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1458 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store .cse12 .cse13 v_ArrVal_1458))) (store (store .cse9 .cse10 v_ArrVal_1460) .cse11 (+ (select .cse9 .cse11) 1)))))) (let ((.cse8 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse5 v_ArrVal_1465) .cse6 (+ (select .cse7 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_2 Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_subst_2) .cse5 v_ArrVal_1474) .cse6 (+ (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 v_subst_2) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (< (select .cse1 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))) (< (select .cse8 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|))))) (forall ((v_ArrVal_1460 Int) (v_ArrVal_1463 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1458 Int)) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse20 (store .cse12 .cse13 v_ArrVal_1458))) (store (store .cse20 .cse10 v_ArrVal_1460) .cse11 (+ (select .cse20 .cse11) 1)))))) (let ((.cse14 (select (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (or (< (select .cse14 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse16 (select (store (store .cse15 |c_~#queue~0.base| (let ((.cse19 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse19 .cse5 v_ArrVal_1465) .cse6 (+ (select .cse19 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_1 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse15 |c_~#queue~0.base| (let ((.cse17 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse18 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse16 .cse2 .cse17) .cse18 v_subst_1) .cse5 v_ArrVal_1474) .cse6 (+ (select (store (store (store .cse16 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse17) .cse18 v_subst_1) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse6) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse16 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))))))))) is different from false [2024-11-11 08:33:54,535 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse13 (select .cse12 .cse11)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse10 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int)) (or (forall ((v_ArrVal_1460 Int) (v_ArrVal_1463 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1458 Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1458))) (store (store .cse9 .cse10 v_ArrVal_1460) .cse11 (+ (select .cse9 .cse11) 1)))))) (let ((.cse8 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse6 v_ArrVal_1465) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_1 Int)) (<= (+ (* 4 (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 .cse4) .cse5 v_subst_1) .cse6 v_ArrVal_1474) .cse1 (+ (select (store (store (store .cse0 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse4) .cse5 v_subst_1) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|))))) (< .cse13 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int)) (or (< .cse13 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1460 Int) (v_ArrVal_1463 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1458 Int)) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse20 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1458))) (store (store .cse20 .cse10 v_ArrVal_1460) .cse11 (+ (select .cse20 .cse11) 1)))))) (let ((.cse19 (select (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse14 (select (store (store .cse15 |c_~#queue~0.base| (let ((.cse18 (store .cse19 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse18 .cse6 v_ArrVal_1465) .cse1 (+ (select .cse18 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (< (select .cse14 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_2 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse15 |c_~#queue~0.base| (let ((.cse16 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse17 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse14 .cse3 .cse16) .cse17 v_subst_2) .cse6 v_ArrVal_1474) .cse1 (+ (select (store (store (store .cse14 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse16) .cse17 v_subst_2) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1)))))))) (< (select .cse19 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|)))))))))) is different from false [2024-11-11 08:33:56,622 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse10 .cse2)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1460 Int) (v_ArrVal_1463 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1458 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1458))) (store (store .cse9 .cse7 v_ArrVal_1460) .cse2 (+ (select .cse9 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse8 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse8 .cse7 v_ArrVal_1465) .cse2 (+ (select .cse8 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_1 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse3 .cse4 .cse5) .cse6 v_subst_1) .cse7 v_ArrVal_1474) .cse2 (+ (select (store (store (store .cse3 .cse7 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse5) .cse6 v_subst_1) .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1460 Int) (v_ArrVal_1463 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1458 Int)) (let ((.cse11 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse16 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1458))) (store (store .cse16 .cse7 v_ArrVal_1460) .cse2 (+ (select .cse16 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (or (< (select .cse11 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse15 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse15 .cse7 v_ArrVal_1465) .cse2 (+ (select .cse15 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (< (select .cse12 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_2 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse13 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse12 .cse4 .cse13) .cse14 v_subst_2) .cse7 v_ArrVal_1474) .cse2 (+ (select (store (store (store .cse12 .cse7 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse13) .cse14 v_subst_2) .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|)))))))))))))) is different from false [2024-11-11 08:33:59,303 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|)) (.cse12 (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1457 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse11 .cse12 v_ArrVal_1457)))) (let ((.cse10 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1460 Int) (v_ArrVal_1463 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1458 Int)) (let ((.cse8 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse9 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1458))) (store (store .cse9 .cse5 v_ArrVal_1460) .cse6 (+ (select .cse9 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse5 v_ArrVal_1465) .cse6 (+ (select .cse7 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_2 Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 v_subst_2) .cse5 v_ArrVal_1474) .cse6 (+ (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 v_subst_2) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (< (select .cse1 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))) (< (select .cse8 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|)))) (< (select .cse10 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| Int) (v_ArrVal_1457 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse11 .cse12 v_ArrVal_1457)))) (let ((.cse13 (select .cse15 |c_~#queue~0.base|))) (or (< (select .cse13 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111|) (forall ((v_ArrVal_1460 Int) (v_ArrVal_1463 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int) (v_ArrVal_1458 Int)) (let ((.cse14 (select (store (store .cse15 |c_~#queue~0.base| (let ((.cse20 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_111| 4) |c_~#queue~0.offset|) v_ArrVal_1458))) (store (store .cse20 .cse5 v_ArrVal_1460) .cse6 (+ (select .cse20 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (or (< (select .cse14 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse16 (select (store (store .cse15 |c_~#queue~0.base| (let ((.cse19 (store .cse14 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse19 .cse5 v_ArrVal_1465) .cse6 (+ (select .cse19 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (v_subst_1 Int)) (<= (+ (* (select (select (store (store .cse15 |c_~#queue~0.base| (let ((.cse17 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse18 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse16 .cse2 .cse17) .cse18 v_subst_1) .cse5 v_ArrVal_1474) .cse6 (+ (select (store (store (store .cse16 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse17) .cse18 v_subst_1) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse16 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|))))))))))))) is different from false [2024-11-11 08:33:59,553 INFO L349 Elim1Store]: treesize reduction 306, result has 39.5 percent of original size [2024-11-11 08:33:59,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 1041 treesize of output 608 [2024-11-11 08:33:59,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:33:59,593 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 561 treesize of output 555 [2024-11-11 08:33:59,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-11 08:33:59,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-11 08:33:59,743 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 42 treesize of output 34 [2024-11-11 08:33:59,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-11 08:33:59,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:33:59,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 168 [2024-11-11 08:34:00,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:34:00,269 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 164 treesize of output 148 [2024-11-11 08:34:00,391 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-11 08:34:00,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:34:00,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:34:00,401 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:34:00,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:34:00,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:34:00,450 INFO L349 Elim1Store]: treesize reduction 60, result has 53.1 percent of original size [2024-11-11 08:34:00,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 874 treesize of output 321 [2024-11-11 08:34:00,461 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:34:00,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:34:00,466 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 127 treesize of output 123 [2024-11-11 08:34:00,474 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:34:00,475 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 111 treesize of output 89 [2024-11-11 08:34:00,481 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:34:00,485 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 71 treesize of output 55 [2024-11-11 08:34:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 15 not checked. [2024-11-11 08:34:00,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010105122] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:34:00,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:34:00,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 31] total 72 [2024-11-11 08:34:00,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479533026] [2024-11-11 08:34:00,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:34:00,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-11 08:34:00,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:34:00,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-11 08:34:00,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=2676, Unknown=126, NotChecked=2250, Total=5402 [2024-11-11 08:34:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:34:00,678 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:34:00,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 4.383561643835616) internal successors, (320), 73 states have internal predecessors, (320), 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-11 08:34:00,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:34:00,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:34:00,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:34:00,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:34:00,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:34:00,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:34:00,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:34:00,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:34:00,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:34:00,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:34:00,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:34:00,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:34:00,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:34:00,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:34:00,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:34:00,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:34:00,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:34:00,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-11 08:34:00,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-11-11 08:34:00,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:34:00,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-11-11 08:34:00,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:34:56,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 08:34:58,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 08:35:00,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 08:35:02,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 08:35:17,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 08:35:19,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 08:35:27,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 7.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 08:35:29,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 08:35:31,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 08:35:38,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 08:35:40,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 08:35:45,848 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse4 .cse3)) (.cse17 (select .cse16 .cse5))) (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse12 (* .cse17 4)) (.cse11 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (+ 1600 |c_~#queue~0.offset|)) (.cse6 (select |c_#length| |c_~#queue~0.base|)) (.cse14 (* .cse0 4))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse1 .cse2 v_ArrVal_1474) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset| 4) .cse6)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse7 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse7 .cse8 .cse9) .cse10 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse11 v_ArrVal_1474) .cse5 (+ (select (store (store (store .cse7 .cse11 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse8 .cse9) .cse10 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse5) 4))))))) (<= (+ .cse12 |c_~#queue~0.offset| 4) .cse6) (forall ((v_ArrVal_1477 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse6)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse13 .cse2 v_ArrVal_1474) .cse3 (+ (select .cse13 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset|))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|))) (forall ((v_ArrVal_1477 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (<= 0 (+ .cse12 |c_~#queue~0.offset|)) (<= 0 (+ .cse14 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse15 (store .cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse15 .cse11 v_ArrVal_1474) .cse5 (+ (select .cse15 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse6)) (< .cse17 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse18 (store .cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse18 .cse11 v_ArrVal_1474) .cse5 (+ (select .cse18 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (< .cse17 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse19 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (< (select .cse19 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse20 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse21 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse19 .cse8 .cse20) .cse21 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse11 v_ArrVal_1474) .cse5 (+ (select (store (store (store .cse19 .cse11 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse8 .cse20) .cse21 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse5) 4) 4) .cse6))))) (<= (+ .cse14 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)))))) is different from false [2024-11-11 08:35:45,870 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse6 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_1474) .cse1 (+ (select (store (store (store .cse0 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4))))))) (forall ((v_ArrVal_1477 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse6)) (forall ((v_ArrVal_1477 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1469 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse7 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1469) |c_~#queue~0.base|))) (or (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse8 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse7 .cse2 .cse8) .cse9 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_1474) .cse1 (+ (select (store (store (store .cse7 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse8) .cse9 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse1) 4) 4) .cse6))))))) is different from false [2024-11-11 08:35:53,477 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select .cse5 .cse4))) (let ((.cse0 (* .cse6 4)) (.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (and (<= (+ .cse0 |c_~#queue~0.offset| 4) .cse1) (<= 0 (+ .cse0 |c_~#queue~0.offset|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse2 .cse3 v_ArrVal_1474) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse1)) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1474 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse3 v_ArrVal_1474) .cse4 (+ (select .cse7 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1477) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|))))))) is different from false [2024-11-11 08:36:29,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 08:36:32,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 08:36:34,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 08:36:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:36:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:36:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:36:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:36:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:36:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:36:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:36:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:36:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:36:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 08:36:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-11 08:36:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-11 08:36:36,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:36:36,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-11 08:36:37,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-11 08:36:37,119 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:36:37,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:36:37,119 INFO L85 PathProgramCache]: Analyzing trace with hash -36817419, now seen corresponding path program 1 times [2024-11-11 08:36:37,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:36:37,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839900760] [2024-11-11 08:36:37,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:36:37,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:36:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:36:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2024-11-11 08:36:37,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:36:37,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839900760] [2024-11-11 08:36:37,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839900760] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:36:37,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586083190] [2024-11-11 08:36:37,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:36:37,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:36:37,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:36:37,829 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:36:37,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 08:36:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:36:38,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 3675 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 08:36:38,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:36:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2024-11-11 08:36:42,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:36:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2024-11-11 08:36:46,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586083190] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:36:46,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:36:46,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-11 08:36:46,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496311020] [2024-11-11 08:36:46,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:36:46,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 08:36:46,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:36:46,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 08:36:46,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-11 08:36:46,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:36:46,744 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:36:46,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 22.5) internal successors, (225), 10 states have internal predecessors, (225), 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-11 08:36:46,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:46,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:36:46,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:46,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:46,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:46,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:46,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:36:46,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:36:46,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:36:46,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:36:46,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:36:46,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:46,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:46,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:46,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:36:46,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:36:46,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:36:46,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-11 08:36:46,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-11-11 08:36:46,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:46,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-11-11 08:36:46,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:36:46,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:36:48,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:48,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:36:48,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:48,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:48,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:48,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:36:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:36:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:36:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:36:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:36:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:36:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:36:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:36:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 08:36:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-11 08:36:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:36:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-11 08:36:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:36:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:36:48,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-11 08:36:48,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:36:48,821 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:36:48,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:36:48,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1476061741, now seen corresponding path program 3 times [2024-11-11 08:36:48,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:36:48,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251931165] [2024-11-11 08:36:48,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:36:48,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:36:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:36:52,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 762 proven. 89 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2024-11-11 08:36:52,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:36:52,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251931165] [2024-11-11 08:36:52,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251931165] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:36:52,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770286867] [2024-11-11 08:36:52,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 08:36:52,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:36:52,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:36:52,222 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:36:52,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-11 08:36:54,273 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-11 08:36:54,273 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 08:36:54,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 2316 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-11 08:36:54,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:37:01,353 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-11 08:37:01,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:37:01,483 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-11 08:37:01,866 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-11 08:37:01,959 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-11 08:37:02,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 68 proven. 234 refuted. 0 times theorem prover too weak. 1121 trivial. 0 not checked. [2024-11-11 08:37:02,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:37:06,149 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2366 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2366) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2366 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2366) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2024-11-11 08:37:06,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:37:06,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 29 treesize of output 30 [2024-11-11 08:37:06,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:37:06,202 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 50 treesize of output 49 [2024-11-11 08:37:06,243 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 14 treesize of output 10 [2024-11-11 08:37:06,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:37:06,258 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-11 08:37:06,262 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:37:06,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:37:06,269 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-11 08:37:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 52 proven. 234 refuted. 0 times theorem prover too weak. 1121 trivial. 16 not checked. [2024-11-11 08:37:12,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770286867] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:37:12,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:37:12,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 8] total 26 [2024-11-11 08:37:12,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798650511] [2024-11-11 08:37:12,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:37:12,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-11 08:37:12,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:37:12,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-11 08:37:12,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=566, Unknown=1, NotChecked=48, Total=702 [2024-11-11 08:37:12,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:37:12,086 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:37:12,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 13.62962962962963) internal successors, (368), 26 states have internal predecessors, (368), 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-11 08:37:12,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:12,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:37:12,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:12,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:12,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:12,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:12,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:37:12,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:37:12,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:37:12,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:37:12,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:37:12,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:12,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:12,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:12,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:37:12,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:37:12,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:37:12,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-11 08:37:12,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-11-11 08:37:12,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:12,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-11-11 08:37:12,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:37:12,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:37:12,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:37:18,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:18,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:37:18,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:18,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:37:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:37:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:37:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:37:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:37:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:37:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:37:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:37:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-11 08:37:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-11 08:37:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:37:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-11 08:37:18,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:37:18,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:37:18,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 08:37:18,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-11 08:37:18,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:37:18,509 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:37:18,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:37:18,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1599502372, now seen corresponding path program 4 times [2024-11-11 08:37:18,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:37:18,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637048926] [2024-11-11 08:37:18,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:37:18,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:37:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:37:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 564 proven. 66 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2024-11-11 08:37:33,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:37:33,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637048926] [2024-11-11 08:37:33,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637048926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:37:33,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707995381] [2024-11-11 08:37:33,269 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 08:37:33,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:37:33,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:37:33,271 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:37:33,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-11 08:37:35,736 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 08:37:35,736 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 08:37:35,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 3871 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-11 08:37:35,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:37:40,776 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-11 08:37:40,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:37:40,908 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-11 08:37:41,277 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-11 08:37:41,363 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-11 08:37:41,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:37:41,869 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 11 [2024-11-11 08:37:41,931 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-11 08:37:42,179 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 19 treesize of output 11 [2024-11-11 08:37:42,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:37:42,354 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-11 08:37:42,787 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-11 08:37:42,874 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-11 08:37:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 321 proven. 239 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2024-11-11 08:37:43,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:37:51,016 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2841 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2841) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2841 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2841) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2024-11-11 08:37:51,061 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2841 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2841) |c_~#queue~0.base|) .cse1)) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2841 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2841) |c_~#queue~0.base|) .cse1))))))) is different from false [2024-11-11 08:37:51,532 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2838 Int) (v_ArrVal_2841 (Array Int Int))) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2838) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2841) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2838 Int) (v_ArrVal_2841 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2838) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2841) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|)))))) is different from false [2024-11-11 08:37:51,592 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2838 Int) (v_ArrVal_2841 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse0 .cse1 v_ArrVal_2838) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2841) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2838 Int) (v_ArrVal_2841 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse6 .cse1 v_ArrVal_2838) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2841) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-11 08:37:51,656 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select .cse3 .cse2)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int)) (or (forall ((v_ArrVal_2838 Int) (v_ArrVal_2841 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse0 .cse1 v_ArrVal_2838) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2841) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|))) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int)) (or (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187|) (forall ((v_ArrVal_2838 Int) (v_ArrVal_2841 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse6 .cse1 v_ArrVal_2838) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2841) |c_~#queue~0.base|) .cse4) 4))))))))) is different from false [2024-11-11 08:37:53,724 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (select .cse3 .cse2))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int)) (or (forall ((v_ArrVal_2838 Int) (v_ArrVal_2841 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse0 .cse1 v_ArrVal_2838) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2841) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int)) (or (forall ((v_ArrVal_2838 Int) (v_ArrVal_2841 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 .cse1 v_ArrVal_2838) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2841) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187|)))))) is different from false [2024-11-11 08:38:07,869 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse5 (select .cse0 .cse4))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2834 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (or (forall ((v_ArrVal_2838 Int) (v_ArrVal_2841 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse1 v_ArrVal_2834) .cse2 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse3 v_ArrVal_2838) .cse4 (+ (select (store (store (store .cse0 .cse3 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 v_ArrVal_2834) .cse2 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2841) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2834 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (or (forall ((v_ArrVal_2838 Int) (v_ArrVal_2841 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse1 v_ArrVal_2834) .cse6 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse3 v_ArrVal_2838) .cse4 (+ (select (store (store (store .cse0 .cse3 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 v_ArrVal_2834) .cse6 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2841) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187|)))))) is different from false [2024-11-11 08:38:08,179 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2832 (Array Int Int)) (v_ArrVal_2834 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2832) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2838 Int) (v_ArrVal_2841 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse1 v_ArrVal_2834) .cse2 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse3 v_ArrVal_2838) .cse4 (+ (select (store (store (store .cse0 .cse3 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 v_ArrVal_2834) .cse2 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2841) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse0 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2832 (Array Int Int)) (v_ArrVal_2834 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2832) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2838 Int) (v_ArrVal_2841 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse5 .cse1 v_ArrVal_2834) .cse6 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse3 v_ArrVal_2838) .cse4 (+ (select (store (store (store .cse5 .cse3 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 v_ArrVal_2834) .cse6 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2841) |c_~#queue~0.base|) .cse4) 4)))) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187|)))))) is different from false [2024-11-11 08:38:08,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:38:08,254 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 129 treesize of output 99 [2024-11-11 08:38:08,424 INFO L349 Elim1Store]: treesize reduction 57, result has 56.2 percent of original size [2024-11-11 08:38:08,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 169 treesize of output 183 [2024-11-11 08:38:08,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:38:08,460 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 90 treesize of output 88 [2024-11-11 08:38:08,471 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-11 08:38:08,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 8 treesize of output 4 [2024-11-11 08:38:08,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:38:08,540 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 42 treesize of output 38 [2024-11-11 08:38:08,609 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-11 08:38:08,618 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:38:08,635 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-11 08:38:08,636 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 65 treesize of output 1 [2024-11-11 08:38:08,643 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:38:08,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:38:08,684 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 113 treesize of output 105 [2024-11-11 08:38:08,734 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-11 08:38:08,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:38:08,771 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:38:08,772 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:38:08,772 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:38:09,016 INFO L349 Elim1Store]: treesize reduction 108, result has 33.3 percent of original size [2024-11-11 08:38:09,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 65 [2024-11-11 08:38:09,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:38:09,181 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 78 treesize of output 70 [2024-11-11 08:38:09,294 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:38:09,296 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:38:09,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:38:09,315 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 132 treesize of output 102 [2024-11-11 08:38:09,319 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:38:09,323 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2024-11-11 08:38:09,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:38:09,339 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 49 treesize of output 37 [2024-11-11 08:38:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 44 proven. 290 refuted. 0 times theorem prover too weak. 876 trivial. 227 not checked. [2024-11-11 08:38:17,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707995381] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:38:17,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:38:17,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 12, 18] total 64 [2024-11-11 08:38:17,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675002182] [2024-11-11 08:38:17,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:38:17,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-11 08:38:17,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:38:17,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-11 08:38:17,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=2887, Unknown=18, NotChecked=936, Total=4160 [2024-11-11 08:38:17,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:38:17,648 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:38:17,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 6.892307692307693) internal successors, (448), 64 states have internal predecessors, (448), 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-11 08:38:17,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:38:17,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:38:17,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:38:17,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:38:17,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:38:17,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:38:17,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:38:17,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:38:17,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:38:17,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:38:17,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:38:17,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:38:17,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:38:17,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:38:17,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:38:17,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:38:17,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:38:17,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-11 08:38:17,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-11-11 08:38:17,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:38:17,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-11-11 08:38:17,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:38:17,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:38:17,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-11 08:38:17,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-11 08:39:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:39:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:39:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 08:39:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-11-11 08:39:09,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-11 08:39:10,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-11 08:39:10,161 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:39:10,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:10,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1908944248, now seen corresponding path program 1 times [2024-11-11 08:39:10,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:10,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115816583] [2024-11-11 08:39:10,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:10,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:39:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1769 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1759 trivial. 0 not checked. [2024-11-11 08:39:10,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:39:10,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115816583] [2024-11-11 08:39:10,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115816583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:39:10,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349368553] [2024-11-11 08:39:10,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:10,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:39:10,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:39:10,728 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:39:10,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-11 08:39:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:11,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 4069 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 08:39:11,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:39:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1769 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1759 trivial. 0 not checked. [2024-11-11 08:39:17,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:39:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1769 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1759 trivial. 0 not checked. [2024-11-11 08:39:20,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349368553] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:39:20,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:39:20,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-11-11 08:39:20,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461909476] [2024-11-11 08:39:20,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:39:20,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 08:39:20,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:39:20,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 08:39:20,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 08:39:20,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:20,157 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:39:20,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-11 08:39:20,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:20,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:20,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:20,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:20,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:20,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:20,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:39:20,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:39:20,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:39:20,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:39:20,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:20,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:20,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:20,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:20,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:39:20,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:39:20,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:39:20,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-11 08:39:20,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-11-11 08:39:20,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:20,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-11-11 08:39:20,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:39:20,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:39:20,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-11 08:39:20,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-11-11 08:39:20,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:23,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:23,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:23,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:39:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 08:39:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:39:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 08:39:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:39:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:39:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:39:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-11 08:39:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-11-11 08:39:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:23,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-11 08:39:23,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-11 08:39:23,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:39:23,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 08:39:23,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-11-11 08:39:23,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:23,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-11 08:39:24,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:39:24,006 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-11 08:39:24,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:24,007 INFO L85 PathProgramCache]: Analyzing trace with hash -725906291, now seen corresponding path program 5 times [2024-11-11 08:39:24,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:24,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548092872] [2024-11-11 08:39:24,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:24,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:39:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:34,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3919 backedges. 2224 proven. 269 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2024-11-11 08:39:34,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:39:34,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548092872] [2024-11-11 08:39:34,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548092872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:39:34,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557806924] [2024-11-11 08:39:34,063 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-11 08:39:34,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:39:34,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:39:34,064 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:39:34,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-11 08:39:42,037 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-11 08:39:42,038 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 08:39:42,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 159 conjuncts are in the unsatisfiable core [2024-11-11 08:39:42,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:39:42,333 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-11 08:39:42,577 INFO L349 Elim1Store]: treesize reduction 34, result has 40.4 percent of original size [2024-11-11 08:39:42,577 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 35 treesize of output 27 [2024-11-11 08:39:43,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:39:43,569 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 54 treesize of output 38 [2024-11-11 08:39:43,795 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 54 treesize of output 38 [2024-11-11 08:39:44,580 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:39:44,648 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-11 08:39:44,649 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 51 [2024-11-11 08:39:44,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:39:44,795 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 54 treesize of output 38 [2024-11-11 08:39:45,240 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 71 treesize of output 40 [2024-11-11 08:39:45,577 INFO L349 Elim1Store]: treesize reduction 34, result has 40.4 percent of original size [2024-11-11 08:39:45,577 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 60 treesize of output 52 [2024-11-11 08:39:46,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:39:46,586 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 54 treesize of output 38 [2024-11-11 08:39:46,818 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 54 treesize of output 38 [2024-11-11 08:39:47,664 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:39:47,724 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-11 08:39:47,724 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 51 [2024-11-11 08:39:47,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:39:47,875 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 54 treesize of output 38 [2024-11-11 08:39:48,496 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 29 treesize of output 3 [2024-11-11 08:39:48,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:39:48,783 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 35 treesize of output 13 [2024-11-11 08:39:49,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:39:49,720 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 29 treesize of output 13 [2024-11-11 08:39:49,937 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 29 treesize of output 13 [2024-11-11 08:39:51,064 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:39:51,111 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-11 08:39:51,112 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-11-11 08:39:51,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:39:51,254 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 29 treesize of output 13 [2024-11-11 08:39:51,763 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 46 treesize of output 15 [2024-11-11 08:39:52,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:39:52,043 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 41 treesize of output 13 [2024-11-11 08:39:52,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:39:52,709 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 29 treesize of output 13 [2024-11-11 08:39:52,780 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 29 treesize of output 13 [2024-11-11 08:39:53,336 INFO L349 Elim1Store]: treesize reduction 61, result has 17.6 percent of original size [2024-11-11 08:39:53,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 19 [2024-11-11 08:39:53,380 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 29 treesize of output 13 [2024-11-11 08:39:53,401 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 7 [2024-11-11 08:39:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3919 backedges. 2269 proven. 111 refuted. 0 times theorem prover too weak. 1539 trivial. 0 not checked. [2024-11-11 08:39:53,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... Killed by 15