./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 9a849f68 Calling Ultimate with: /root/.sdkman/candidates/java/current/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-dev-9a849f6-m [2024-10-26 06:12:46,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-26 06:12:46,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2024-10-26 06:12:46,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-26 06:12:46,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-26 06:12:46,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-26 06:12:46,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-26 06:12:46,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-26 06:12:46,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-26 06:12:46,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-26 06:12:46,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-26 06:12:46,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-26 06:12:46,742 INFO L153 SettingsManager]: * Use SBE=true [2024-10-26 06:12:46,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-26 06:12:46,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-26 06:12:46,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-26 06:12:46,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-26 06:12:46,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-26 06:12:46,746 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-26 06:12:46,746 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-26 06:12:46,746 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-26 06:12:46,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-26 06:12:46,751 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-26 06:12:46,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-26 06:12:46,751 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-26 06:12:46,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-26 06:12:46,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-26 06:12:46,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-26 06:12:46,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-26 06:12:46,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-26 06:12:46,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-26 06:12:46,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 06:12:46,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-26 06:12:46,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-26 06:12:46,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-26 06:12:46,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-26 06:12:46,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-26 06:12:46,754 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-10-26 06:12:46,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-26 06:12:46,758 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-26 06:12:46,758 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-26 06:12:46,758 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-10-26 06:12:47,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-26 06:12:47,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-26 06:12:47,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-26 06:12:47,051 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-26 06:12:47,051 INFO L274 PluginConnector]: CDTParser initialized [2024-10-26 06:12:47,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/queue_longer.i [2024-10-26 06:12:48,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-26 06:12:48,748 INFO L384 CDTParser]: Found 1 translation units. [2024-10-26 06:12:48,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i [2024-10-26 06:12:48,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9eb9bfe6b/ef10f62336f844758873962ea2ea7682/FLAGf9879e861 [2024-10-26 06:12:48,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9eb9bfe6b/ef10f62336f844758873962ea2ea7682 [2024-10-26 06:12:48,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-26 06:12:48,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-26 06:12:48,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-26 06:12:48,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-26 06:12:48,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-26 06:12:48,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:12:48" (1/1) ... [2024-10-26 06:12:48,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e7e52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:12:48, skipping insertion in model container [2024-10-26 06:12:48,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:12:48" (1/1) ... [2024-10-26 06:12:48,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-26 06:12:49,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 06:12:49,376 INFO L200 MainTranslator]: Completed pre-run [2024-10-26 06:12:49,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 06:12:49,587 INFO L204 MainTranslator]: Completed translation [2024-10-26 06:12:49,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:12:49 WrapperNode [2024-10-26 06:12:49,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-26 06:12:49,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-26 06:12:49,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-26 06:12:49,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-26 06:12:49,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:12:49" (1/1) ... [2024-10-26 06:12:49,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:12:49" (1/1) ... [2024-10-26 06:12:49,761 INFO L138 Inliner]: procedures = 274, calls = 859, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1046 [2024-10-26 06:12:49,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-26 06:12:49,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-26 06:12:49,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-26 06:12:49,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-26 06:12:49,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:12:49" (1/1) ... [2024-10-26 06:12:49,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:12:49" (1/1) ... [2024-10-26 06:12:49,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:12:49" (1/1) ... [2024-10-26 06:12:49,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:12:49" (1/1) ... [2024-10-26 06:12:49,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:12:49" (1/1) ... [2024-10-26 06:12:49,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:12:49" (1/1) ... [2024-10-26 06:12:49,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:12:49" (1/1) ... [2024-10-26 06:12:49,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:12:49" (1/1) ... [2024-10-26 06:12:49,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-26 06:12:49,865 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-26 06:12:49,865 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-26 06:12:49,865 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-26 06:12:49,866 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:12:49" (1/1) ... [2024-10-26 06:12:49,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 06:12:49,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:12:49,904 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-10-26 06:12:49,913 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-10-26 06:12:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-26 06:12:49,961 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-26 06:12:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-26 06:12:49,962 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-26 06:12:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-26 06:12:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-26 06:12:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-26 06:12:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-26 06:12:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-26 06:12:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-26 06:12:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-26 06:12:49,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-26 06:12:49,966 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-26 06:12:50,144 INFO L238 CfgBuilder]: Building ICFG [2024-10-26 06:12:50,146 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-26 06:12:51,535 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-26 06:12:51,536 INFO L287 CfgBuilder]: Performing block encoding [2024-10-26 06:12:57,984 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-26 06:12:57,984 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-26 06:12:57,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:12:57 BoogieIcfgContainer [2024-10-26 06:12:57,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-26 06:12:57,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-26 06:12:57,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-26 06:12:57,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-26 06:12:57,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 06:12:48" (1/3) ... [2024-10-26 06:12:57,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acc7dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 06:12:57, skipping insertion in model container [2024-10-26 06:12:57,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:12:49" (2/3) ... [2024-10-26 06:12:57,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acc7dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 06:12:57, skipping insertion in model container [2024-10-26 06:12:57,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:12:57" (3/3) ... [2024-10-26 06:12:57,996 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-10-26 06:12:58,014 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-26 06:12:58,014 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2024-10-26 06:12:58,014 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-26 06:12:58,137 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-26 06:12:58,184 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 06:12:58,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 06:12:58,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:12:58,187 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-10-26 06:12:58,189 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-10-26 06:12:58,235 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 06:12:58,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-10-26 06:12:58,253 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;@43fe3c09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 06:12:58,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-10-26 06:12:58,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:12:58,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:12:58,603 INFO L85 PathProgramCache]: Analyzing trace with hash -994868920, now seen corresponding path program 1 times [2024-10-26 06:12:58,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:12:58,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975737535] [2024-10-26 06:12:58,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:12:58,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:12:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:12:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:12:59,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:12:59,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975737535] [2024-10-26 06:12:59,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975737535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:12:59,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:12:59,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 06:12:59,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047158977] [2024-10-26 06:12:59,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:12:59,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 06:12:59,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:12:59,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 06:12:59,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 06:12:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:12:59,194 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:12:59,194 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-10-26 06:12:59,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:12:59,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:12:59,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-26 06:12:59,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:12:59,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:12:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash -994868919, now seen corresponding path program 1 times [2024-10-26 06:12:59,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:12:59,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254686045] [2024-10-26 06:12:59,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:12:59,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:12:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:01,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:01,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:13:01,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254686045] [2024-10-26 06:13:01,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254686045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:13:01,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:13:01,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 06:13:01,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695219890] [2024-10-26 06:13:01,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:13:01,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 06:13:01,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:13:01,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 06:13:01,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-26 06:13:01,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:01,155 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:13:01,155 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-10-26 06:13:01,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:01,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:02,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:02,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:02,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-26 06:13:02,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:13:02,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:13:02,002 INFO L85 PathProgramCache]: Analyzing trace with hash 494858813, now seen corresponding path program 1 times [2024-10-26 06:13:02,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:13:02,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521418447] [2024-10-26 06:13:02,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:13:02,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:13:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:02,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:02,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:13:02,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521418447] [2024-10-26 06:13:02,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521418447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:13:02,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:13:02,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-26 06:13:02,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585827313] [2024-10-26 06:13:02,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:13:02,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 06:13:02,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:13:02,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 06:13:02,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 06:13:02,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:02,256 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:13:02,256 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-10-26 06:13:02,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:02,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:02,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:02,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:02,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-26 06:13:02,479 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:13:02,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:13:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2068756552, now seen corresponding path program 1 times [2024-10-26 06:13:02,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:13:02,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840685712] [2024-10-26 06:13:02,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:13:02,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:13:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:02,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:13:02,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840685712] [2024-10-26 06:13:02,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840685712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:13:02,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:13:02,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-26 06:13:02,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507937243] [2024-10-26 06:13:02,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:13:02,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 06:13:02,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:13:02,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 06:13:02,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 06:13:02,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:02,785 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:13:02,785 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-10-26 06:13:02,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:02,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:02,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:02,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:03,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:03,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-26 06:13:03,012 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:13:03,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:13:03,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2068756551, now seen corresponding path program 1 times [2024-10-26 06:13:03,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:13:03,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869046775] [2024-10-26 06:13:03,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:13:03,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:13:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:03,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:13:03,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869046775] [2024-10-26 06:13:03,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869046775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:13:03,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:13:03,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-26 06:13:03,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30405585] [2024-10-26 06:13:03,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:13:03,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 06:13:03,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:13:03,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 06:13:03,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 06:13:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:03,414 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:13:03,414 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-10-26 06:13:03,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:03,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:03,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:03,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:03,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:03,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:03,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:03,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:03,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:03,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:03,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-26 06:13:03,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:13:03,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:13:03,856 INFO L85 PathProgramCache]: Analyzing trace with hash 494891520, now seen corresponding path program 1 times [2024-10-26 06:13:03,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:13:03,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183378498] [2024-10-26 06:13:03,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:13:03,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:13:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:03,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:13:03,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183378498] [2024-10-26 06:13:03,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183378498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:13:03,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:13:03,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 06:13:03,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99651429] [2024-10-26 06:13:03,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:13:03,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 06:13:03,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:13:03,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 06:13:03,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 06:13:03,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:03,975 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:13:03,975 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-10-26 06:13:03,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:03,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:03,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:03,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:03,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:03,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:04,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:04,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:04,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:04,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:04,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:04,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:04,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-26 06:13:04,372 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:13:04,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:13:04,372 INFO L85 PathProgramCache]: Analyzing trace with hash 494891521, now seen corresponding path program 1 times [2024-10-26 06:13:04,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:13:04,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026462257] [2024-10-26 06:13:04,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:13:04,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:13:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:04,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:13:04,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026462257] [2024-10-26 06:13:04,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026462257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:13:04,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:13:04,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-26 06:13:04,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010848412] [2024-10-26 06:13:04,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:13:04,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-26 06:13:04,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:13:04,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-26 06:13:04,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-26 06:13:04,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:04,794 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:13:04,794 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-10-26 06:13:04,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:04,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:04,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:04,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:04,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:04,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:04,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:05,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:05,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-26 06:13:05,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:13:05,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:13:05,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1861204073, now seen corresponding path program 1 times [2024-10-26 06:13:05,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:13:05,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395915870] [2024-10-26 06:13:05,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:13:05,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:13:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:06,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:13:06,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395915870] [2024-10-26 06:13:06,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395915870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:13:06,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:13:06,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-26 06:13:06,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370869664] [2024-10-26 06:13:06,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:13:06,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-26 06:13:06,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:13:06,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-26 06:13:06,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-26 06:13:06,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:06,504 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:13:06,504 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-10-26 06:13:06,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:06,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:06,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:06,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:06,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:06,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:06,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:06,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:06,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:06,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:06,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:06,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:06,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:06,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:06,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:06,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:06,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-26 06:13:06,991 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:13:06,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:13:06,991 INFO L85 PathProgramCache]: Analyzing trace with hash 750049702, now seen corresponding path program 1 times [2024-10-26 06:13:06,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:13:06,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210764862] [2024-10-26 06:13:06,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:13:06,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:13:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:09,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:09,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:13:09,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210764862] [2024-10-26 06:13:09,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210764862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:13:09,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:13:09,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-26 06:13:09,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709686930] [2024-10-26 06:13:09,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:13:09,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-26 06:13:09,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:13:09,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-26 06:13:09,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-10-26 06:13:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:09,947 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:13:09,947 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-10-26 06:13:09,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:09,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:09,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:09,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:11,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-26 06:13:11,212 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:13:11,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:13:11,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1845955818, now seen corresponding path program 1 times [2024-10-26 06:13:11,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:13:11,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433995904] [2024-10-26 06:13:11,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:13:11,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:13:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:13,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:13:13,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433995904] [2024-10-26 06:13:13,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433995904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:13:13,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:13:13,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-26 06:13:13,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717062394] [2024-10-26 06:13:13,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:13:13,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-26 06:13:13,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:13:13,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-26 06:13:13,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-26 06:13:13,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:13,214 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:13:13,214 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-10-26 06:13:13,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:13,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:13,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:13,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:13,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:13,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:13,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:13,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:13,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:13,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:14,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:13:14,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-26 06:13:14,144 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:13:14,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:13:14,144 INFO L85 PathProgramCache]: Analyzing trace with hash -156280063, now seen corresponding path program 1 times [2024-10-26 06:13:14,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:13:14,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121945067] [2024-10-26 06:13:14,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:13:14,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:13:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:14,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:13:14,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121945067] [2024-10-26 06:13:14,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121945067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:13:14,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:13:14,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 06:13:14,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158011274] [2024-10-26 06:13:14,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:13:14,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-26 06:13:14,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:13:14,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-26 06:13:14,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-26 06:13:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:14,550 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:13:14,551 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-10-26 06:13:14,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:14,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:14,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:14,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:14,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:13:14,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:14,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:14,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:14,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:14,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:14,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:13:14,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:13:14,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-26 06:13:14,749 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:13:14,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:13:14,750 INFO L85 PathProgramCache]: Analyzing trace with hash -811902022, now seen corresponding path program 1 times [2024-10-26 06:13:14,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:13:14,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911141328] [2024-10-26 06:13:14,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:13:14,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:13:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:14,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:14,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:13:14,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911141328] [2024-10-26 06:13:14,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911141328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:13:14,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:13:14,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-26 06:13:14,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954356807] [2024-10-26 06:13:14,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:13:14,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 06:13:14,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:13:14,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 06:13:14,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 06:13:14,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:14,918 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:13:14,918 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-10-26 06:13:14,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:14,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:14,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:14,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:14,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:14,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:13:14,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:13:14,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:13:15,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:13:15,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:15,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-26 06:13:15,953 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:13:15,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:13:15,953 INFO L85 PathProgramCache]: Analyzing trace with hash -180474182, now seen corresponding path program 1 times [2024-10-26 06:13:15,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:13:15,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776836115] [2024-10-26 06:13:15,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:13:15,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:13:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-26 06:13:16,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:13:16,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776836115] [2024-10-26 06:13:16,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776836115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:13:16,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:13:16,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-26 06:13:16,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530853928] [2024-10-26 06:13:16,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:13:16,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 06:13:16,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:13:16,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 06:13:16,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 06:13:16,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:16,394 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:13:16,395 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-10-26 06:13:16,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:16,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:16,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:16,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:16,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:13:16,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:13:16,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:16,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:13:16,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:13:16,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-26 06:13:16,626 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:13:16,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:13:16,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1393124767, now seen corresponding path program 1 times [2024-10-26 06:13:16,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:13:16,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206646932] [2024-10-26 06:13:16,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:13:16,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:13:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:16,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:13:16,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206646932] [2024-10-26 06:13:16,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206646932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:13:16,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:13:16,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 06:13:16,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680171363] [2024-10-26 06:13:16,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:13:16,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 06:13:16,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:13:16,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 06:13:16,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 06:13:16,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:16,827 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:13:16,827 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-10-26 06:13:16,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:16,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:16,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:16,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:16,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:13:16,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:13:16,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:16,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:13:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:13:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:17,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-26 06:13:17,034 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:13:17,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:13:17,034 INFO L85 PathProgramCache]: Analyzing trace with hash -113715809, now seen corresponding path program 1 times [2024-10-26 06:13:17,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:13:17,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569909389] [2024-10-26 06:13:17,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:13:17,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:13:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:19,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:13:19,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569909389] [2024-10-26 06:13:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569909389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:13:19,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:13:19,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-26 06:13:19,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925204013] [2024-10-26 06:13:19,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:13:19,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-26 06:13:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:13:19,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-26 06:13:19,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-10-26 06:13:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:19,104 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:13:19,104 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-10-26 06:13:19,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:19,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:19,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:19,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:19,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:19,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:19,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:19,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:19,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:19,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:13:19,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:13:19,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:19,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:19,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:19,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:19,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:19,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:19,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:19,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:19,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:19,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:19,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:19,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:19,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:19,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:13:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:13:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:19,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-26 06:13:19,979 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:13:19,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:13:19,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1619523975, now seen corresponding path program 1 times [2024-10-26 06:13:19,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:13:19,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280796138] [2024-10-26 06:13:19,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:13:19,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:13:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:23,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:13:23,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280796138] [2024-10-26 06:13:23,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280796138] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:13:23,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674354511] [2024-10-26 06:13:23,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:13:23,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:13:23,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:13:23,117 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-10-26 06:13:23,118 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-10-26 06:13:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:23,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 2107 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-10-26 06:13:23,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:13:23,579 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-10-26 06:13:23,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:13:23,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:13:23,888 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-10-26 06:13:23,923 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-10-26 06:13:24,030 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-10-26 06:13:24,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:13:24,087 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-10-26 06:13:24,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:13:24,252 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-10-26 06:13:24,278 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-10-26 06:13:24,370 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-10-26 06:13:24,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:13:24,414 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-10-26 06:13:24,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 06:13:24,634 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-10-26 06:13:24,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:24,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:13:29,203 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-10-26 06:13:29,225 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-10-26 06:13:29,235 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-10-26 06:13:29,256 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-10-26 06:13:29,277 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-10-26 06:13:29,320 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-10-26 06:13:37,686 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |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 ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse2 .cse3 v_ArrVal_425) .cse1 (+ (select .cse2 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (< (select .cse4 .cse1) |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 .cse3 v_ArrVal_425) .cse1 (+ (select .cse5 .cse1) 1)))) |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-10-26 06:13:37,766 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-10-26 06:13:37,803 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-10-26 06:13:38,841 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-10-26 06:13:40,899 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-10-26 06:13:42,947 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-10-26 06:13:45,331 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|)) (.cse8 (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31| Int) (v_ArrVal_416 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse7 .cse8 v_ArrVal_416)))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |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 ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|)) v_ArrVal_418))) (store (store .cse6 .cse5 v_ArrVal_420) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (< (select .cse2 .cse1) |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 .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 .cse5 v_ArrVal_425) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31| Int) (v_ArrVal_416 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse7 .cse8 v_ArrVal_416)))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (or (< (select .cse9 .cse1) |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 ((.cse12 (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse13 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|)) v_ArrVal_418))) (store (store .cse13 .cse5 v_ArrVal_420) .cse1 (+ (select .cse13 .cse1) 1)))) |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 (+ (* 4 (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) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)))))))))) is different from false [2024-10-26 06:13:45,526 INFO L349 Elim1Store]: treesize reduction 306, result has 39.5 percent of original size [2024-10-26 06:13:45,527 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-10-26 06:13:45,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:13:45,580 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-10-26 06:13:45,597 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-10-26 06:13:45,621 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-10-26 06:13:45,742 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-10-26 06:13:45,789 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-10-26 06:13:45,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:13:45,865 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-10-26 06:13:46,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:13:46,376 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-10-26 06:13:46,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:13:46,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:13:46,573 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:13:46,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:13:46,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:13:46,602 INFO L349 Elim1Store]: treesize reduction 60, result has 53.1 percent of original size [2024-10-26 06:13:46,602 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-10-26 06:13:46,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:13:46,619 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:13:46,623 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-10-26 06:13:46,630 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:13:46,631 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-10-26 06:13:46,735 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:13:46,737 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-10-26 06:13:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-26 06:13:46,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674354511] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:13:46,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:13:46,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 21] total 56 [2024-10-26 06:13:46,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725617219] [2024-10-26 06:13:46,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:13:46,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-26 06:13:46,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:13:46,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-26 06:13:46,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1692, Unknown=32, NotChecked=1248, Total=3192 [2024-10-26 06:13:46,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:46,795 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:13:46,796 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-10-26 06:13:46,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:46,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:46,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:46,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:46,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:46,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:46,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:46,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:46,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:46,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:13:46,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:13:46,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:46,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:46,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:46,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:46,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:52,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:52,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:52,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:52,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:52,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:52,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:52,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:13:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:13:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-26 06:13:52,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-26 06:13:52,517 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-10-26 06:13:52,517 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:13:52,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:13:52,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1144524775, now seen corresponding path program 1 times [2024-10-26 06:13:52,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:13:52,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764672290] [2024-10-26 06:13:52,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:13:52,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:13:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:53,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:13:53,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764672290] [2024-10-26 06:13:53,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764672290] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:13:53,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109375680] [2024-10-26 06:13:53,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:13:53,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:13:53,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:13:53,007 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-10-26 06:13:53,008 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-10-26 06:13:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:13:53,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 2158 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-26 06:13:53,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:13:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:53,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:13:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 06:13:54,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109375680] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:13:54,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:13:54,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-10-26 06:13:54,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782397892] [2024-10-26 06:13:54,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:13:54,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-26 06:13:54,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:13:54,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-26 06:13:54,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-26 06:13:54,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:13:54,216 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:13:54,216 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-10-26 06:13:54,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:54,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:13:54,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:54,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:54,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:54,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:54,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:13:54,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:13:54,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:54,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:13:54,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:13:54,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:54,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:54,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:13:54,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:13:54,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-26 06:13:54,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:14:03,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:03,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:14:03,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:14:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:14:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:14:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-26 06:14:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:14:03,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-26 06:14:03,295 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-10-26 06:14:03,295 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:14:03,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:14:03,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1960300065, now seen corresponding path program 1 times [2024-10-26 06:14:03,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:14:03,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43240199] [2024-10-26 06:14:03,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:14:03,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:14:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:14:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-26 06:14:03,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:14:03,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43240199] [2024-10-26 06:14:03,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43240199] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:14:03,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594143543] [2024-10-26 06:14:03,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:14:03,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:14:03,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:14:03,920 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-10-26 06:14:03,922 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-10-26 06:14:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:14:04,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 2732 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-26 06:14:04,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:14:05,169 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-26 06:14:05,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:14:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-26 06:14:05,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594143543] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:14:05,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:14:05,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-10-26 06:14:05,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95651724] [2024-10-26 06:14:05,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:14:05,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-26 06:14:05,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:14:05,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-26 06:14:05,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-26 06:14:05,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:14:05,723 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:14:05,724 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-10-26 06:14:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:14:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:14:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:14:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:14:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-10-26 06:14:05,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:14:05,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:14:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:14:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:14:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:14:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:14:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-26 06:14:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:14:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:06,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-26 06:14:06,308 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-10-26 06:14:06,309 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:14:06,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:14:06,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1642891225, now seen corresponding path program 1 times [2024-10-26 06:14:06,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:14:06,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616810581] [2024-10-26 06:14:06,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:14:06,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:14:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:14:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 315 proven. 16 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-26 06:14:10,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:14:10,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616810581] [2024-10-26 06:14:10,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616810581] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:14:10,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639217253] [2024-10-26 06:14:10,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:14:10,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:14:10,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:14:10,218 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-10-26 06:14:10,220 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-10-26 06:14:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:14:10,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 2907 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-26 06:14:10,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:14:11,163 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-10-26 06:14:11,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:14:11,191 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-10-26 06:14:11,287 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-10-26 06:14:11,373 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-10-26 06:14:11,605 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-10-26 06:14:11,605 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-10-26 06:14:11,641 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-10-26 06:14:11,690 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-10-26 06:14:11,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:14:11,734 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-10-26 06:14:11,823 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-10-26 06:14:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 295 proven. 36 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-26 06:14:11,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:14:11,907 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1024 (Array Int Int))) (not (= 400 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1024) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))) is different from false [2024-10-26 06:14:13,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:14:13,013 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-10-26 06:14:13,129 INFO L349 Elim1Store]: treesize reduction 192, result has 41.8 percent of original size [2024-10-26 06:14:13,129 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-10-26 06:14:13,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:14:13,167 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-10-26 06:14:13,176 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-10-26 06:14:13,184 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-10-26 06:14:13,462 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 281 proven. 46 refuted. 0 times theorem prover too weak. 81 trivial. 4 not checked. [2024-10-26 06:14:13,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639217253] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:14:13,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:14:13,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 18] total 45 [2024-10-26 06:14:13,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840446453] [2024-10-26 06:14:13,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:14:13,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-26 06:14:13,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:14:13,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-26 06:14:13,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1626, Unknown=24, NotChecked=86, Total=2070 [2024-10-26 06:14:13,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:14:13,467 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:14:13,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 8.869565217391305) internal successors, (408), 45 states have internal predecessors, (408), 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-10-26 06:14:13,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:13,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:14:13,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:13,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:13,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:13,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:13,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:13,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:14:13,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:13,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:14:13,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:14:13,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:13,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:13,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:13,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:13,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-10-26 06:14:13,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:14:13,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:13,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:14:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:14:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:14:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:14:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:14:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-26 06:14:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:14:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 06:14:16,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-26 06:14:16,626 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-10-26 06:14:16,626 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:14:16,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:14:16,627 INFO L85 PathProgramCache]: Analyzing trace with hash 908437829, now seen corresponding path program 1 times [2024-10-26 06:14:16,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:14:16,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346556260] [2024-10-26 06:14:16,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:14:16,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:14:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:14:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-26 06:14:16,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:14:16,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346556260] [2024-10-26 06:14:16,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346556260] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:14:16,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120634575] [2024-10-26 06:14:16,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:14:16,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:14:16,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:14:16,879 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-10-26 06:14:16,880 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-10-26 06:14:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:14:17,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 2331 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-26 06:14:17,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:14:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-26 06:14:17,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:14:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-26 06:14:17,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120634575] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:14:17,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:14:17,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-10-26 06:14:17,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800288841] [2024-10-26 06:14:17,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:14:17,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 06:14:17,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:14:17,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 06:14:17,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-26 06:14:17,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:14:17,690 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:14:17,690 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-10-26 06:14:17,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:17,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:14:17,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:17,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:17,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:17,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:17,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:17,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:14:17,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:17,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:14:17,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:14:17,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:17,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:17,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:17,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:17,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-10-26 06:14:17,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:14:17,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:17,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 06:14:17,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:14:18,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:14:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:14:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:14:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:14:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-26 06:14:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:14:18,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:18,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:14:18,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:14:18,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-26 06:14:18,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:14:18,681 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:14:18,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:14:18,682 INFO L85 PathProgramCache]: Analyzing trace with hash -777662871, now seen corresponding path program 2 times [2024-10-26 06:14:18,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:14:18,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263835950] [2024-10-26 06:14:18,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:14:18,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:14:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:14:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-10-26 06:14:19,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:14:19,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263835950] [2024-10-26 06:14:19,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263835950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:14:19,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:14:19,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-26 06:14:19,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691926954] [2024-10-26 06:14:19,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:14:19,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 06:14:19,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:14:19,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 06:14:19,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 06:14:19,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:14:19,059 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:14:19,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-10-26 06:14:19,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:19,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:14:19,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:19,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:19,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:19,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:19,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:19,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:14:19,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:19,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:14:19,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:14:19,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:19,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:19,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:19,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:19,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-10-26 06:14:19,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:14:19,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:19,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:14:19,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:14:19,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:14:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:14:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:14:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:14:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:14:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:19,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-26 06:14:19,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:14:19,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:19,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:14:19,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:14:19,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:19,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-26 06:14:19,380 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:14:19,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:14:19,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1611366878, now seen corresponding path program 3 times [2024-10-26 06:14:19,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:14:19,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808243293] [2024-10-26 06:14:19,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:14:19,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:14:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:14:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 204 proven. 18 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-26 06:14:26,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:14:26,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808243293] [2024-10-26 06:14:26,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808243293] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:14:26,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471094847] [2024-10-26 06:14:26,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 06:14:26,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:14:26,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:14:26,452 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-10-26 06:14:26,453 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-10-26 06:14:27,430 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-26 06:14:27,430 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 06:14:27,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 2079 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-26 06:14:27,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:14:28,264 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-10-26 06:14:28,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:14:28,300 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-10-26 06:14:28,406 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-10-26 06:14:28,427 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-10-26 06:14:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 33 proven. 114 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2024-10-26 06:14:28,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:14:28,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-10-26 06:14:28,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:14:28,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-10-26 06:14:28,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:14:28,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-10-26 06:14:28,898 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-10-26 06:14:28,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:14:28,907 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-10-26 06:14:28,909 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:14:28,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:14:28,911 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-10-26 06:14:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 25 proven. 122 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2024-10-26 06:14:29,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471094847] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:14:29,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:14:29,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 8] total 36 [2024-10-26 06:14:29,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367343839] [2024-10-26 06:14:29,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:14:29,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-26 06:14:29,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:14:29,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-26 06:14:29,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1149, Unknown=10, NotChecked=0, Total=1332 [2024-10-26 06:14:29,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:14:29,468 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:14:29,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 8.837837837837839) internal successors, (327), 36 states have internal predecessors, (327), 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-10-26 06:14:29,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:29,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:14:29,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:29,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:29,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:29,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:29,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:29,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:14:29,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:29,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:14:29,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:14:29,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:29,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:29,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:29,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:14:29,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-10-26 06:14:29,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:14:29,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:14:29,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:14:29,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:14:29,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:14:29,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:14:33,527 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-10-26 06:14:38,160 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-10-26 06:14:40,252 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-10-26 06:14:42,264 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-10-26 06:14:44,591 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-10-26 06:14:46,672 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-10-26 06:14:48,689 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-10-26 06:14:50,698 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-10-26 06:14:52,724 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-10-26 06:14:54,732 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-10-26 06:14:56,767 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-10-26 06:14:58,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 06:15:00,729 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-10-26 06:15:02,757 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-10-26 06:15:04,835 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-10-26 06:15:07,109 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-10-26 06:15:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:15:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:15:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:15:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:15:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:15:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:15:07,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:07,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:07,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:07,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:15:07,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-26 06:15:07,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:15:07,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:15:07,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:15:07,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:15:07,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:07,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-26 06:15:07,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-26 06:15:07,938 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-10-26 06:15:07,939 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:15:07,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:15:07,939 INFO L85 PathProgramCache]: Analyzing trace with hash 705868595, now seen corresponding path program 4 times [2024-10-26 06:15:07,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:15:07,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180444494] [2024-10-26 06:15:07,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:15:07,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:15:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:15:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 232 proven. 48 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-10-26 06:15:15,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:15:15,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180444494] [2024-10-26 06:15:15,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180444494] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:15:15,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382738199] [2024-10-26 06:15:15,932 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-26 06:15:15,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:15:15,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:15:15,933 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-10-26 06:15:15,934 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-10-26 06:15:16,700 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-26 06:15:16,700 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 06:15:16,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 2914 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-10-26 06:15:16,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:15:17,077 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-10-26 06:15:17,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:15:17,113 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-10-26 06:15:17,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:15:17,215 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-10-26 06:15:17,239 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 23 treesize of output 22 [2024-10-26 06:15:17,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:15:17,422 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:15:17,443 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-10-26 06:15:17,444 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-10-26 06:15:17,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:15:17,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:15:17,478 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-10-26 06:15:17,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:15:17,573 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-10-26 06:15:17,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:15:17,619 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-10-26 06:15:17,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:15:17,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:15:17,751 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-10-26 06:15:17,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:15:17,846 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-10-26 06:15:18,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:15:18,044 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:15:18,061 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-10-26 06:15:18,061 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-10-26 06:15:18,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:15:18,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:15:18,087 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-10-26 06:15:18,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:15:18,134 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-10-26 06:15:18,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:15:18,190 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-10-26 06:15:18,316 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-10-26 06:15:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 242 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-26 06:15:18,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:15:18,454 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1849 (Array Int Int))) (not (= 400 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1849) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))) is different from false [2024-10-26 06:15:20,034 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_1847 Int) (v_ArrVal_1839 Int) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1846 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_1839)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1841) |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)) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1846) .cse3 v_ArrVal_1847)) |c_~#stored_elements~0.base| v_ArrVal_1849) |c_~#queue~0.base|) .cse2)))) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1839))))) is different from false [2024-10-26 06:15:20,049 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_1847 Int) (v_ArrVal_1839 Int) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1846 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 .cse4 .cse5 v_ArrVal_1839)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1841) |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)) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1846) .cse3 v_ArrVal_1847)) |c_~#stored_elements~0.base| v_ArrVal_1849) |c_~#queue~0.base|) .cse2)))) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1839)))))) is different from false [2024-10-26 06:15:20,096 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_1847 Int) (v_ArrVal_1839 Int) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1846 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_1837) .cse5 v_ArrVal_1839)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1841) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (= (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)) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1846) .cse3 v_ArrVal_1847)) |c_~#stored_elements~0.base| v_ArrVal_1849) |c_~#queue~0.base|) .cse2)) 400)) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1839) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|)))))) is different from false [2024-10-26 06:15:20,143 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_1847 Int) (v_ArrVal_1839 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_80| Int) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1846 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (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|)) (.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_1837) .cse5 v_ArrVal_1839)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1841) |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)) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_80|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1846) .cse3 v_ArrVal_1847)) |c_~#stored_elements~0.base| v_ArrVal_1849) |c_~#queue~0.base|) .cse2)))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1839) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|)))))) is different from false [2024-10-26 06:15:20,179 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_124| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_1837 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_1847 Int) (v_ArrVal_1839 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_80| Int) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1846 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_124| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1837) .cse3 v_ArrVal_1839)))) (let ((.cse0 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1841) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1839) (not (= 400 (let ((.cse5 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse0 .cse5 (+ (select .cse0 .cse5) 1)) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_80|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1846) .cse1 v_ArrVal_1847)) |c_~#stored_elements~0.base| v_ArrVal_1849) |c_~#queue~0.base|) .cse5))))))))) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_124|)))) is different from false [2024-10-26 06:15:47,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:15:47,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 292 treesize of output 212 [2024-10-26 06:15:48,045 INFO L349 Elim1Store]: treesize reduction 32, result has 60.0 percent of original size [2024-10-26 06:15:48,045 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 405 treesize of output 365 [2024-10-26 06:15:48,061 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-10-26 06:15:48,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:15:48,080 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 195 treesize of output 185 [2024-10-26 06:15:48,087 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 44 treesize of output 40 [2024-10-26 06:15:48,094 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-10-26 06:15:48,119 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-10-26 06:15:48,167 INFO L349 Elim1Store]: treesize reduction 62, result has 40.4 percent of original size [2024-10-26 06:15:48,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 51 treesize of output 57 [2024-10-26 06:15:48,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:15:48,219 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 71 treesize of output 77 [2024-10-26 06:15:48,246 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:15:48,248 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:15:48,256 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:15:48,259 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 130 treesize of output 112 [2024-10-26 06:15:48,262 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:15:48,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:15:48,264 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:15:48,266 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:15:48,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:15:48,280 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-10-26 06:15:48,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 1 [2024-10-26 06:15:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 150 proven. 92 refuted. 60 times theorem prover too weak. 77 trivial. 38 not checked. [2024-10-26 06:15:56,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382738199] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:15:56,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:15:56,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 27] total 70 [2024-10-26 06:15:56,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995979471] [2024-10-26 06:15:56,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:15:56,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-10-26 06:15:56,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:15:56,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-10-26 06:15:56,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=3498, Unknown=57, NotChecked=786, Total=4970 [2024-10-26 06:15:56,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:15:56,563 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:15:56,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 6.408450704225352) internal successors, (455), 70 states have internal predecessors, (455), 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-10-26 06:15:56,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:56,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:15:56,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:56,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:56,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:56,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:56,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:15:56,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:15:56,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:15:56,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:15:56,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:15:56,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:56,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:56,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:56,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:15:56,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-10-26 06:15:56,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:15:56,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:15:56,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:15:56,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:15:56,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:15:56,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-26 06:15:56,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:16:05,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-10-26 06:16:07,735 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-10-26 06:16:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:16:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:16:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:16:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:16:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:16:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:16:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:16:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-26 06:16:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:16:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:16:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:16:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:16:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-26 06:16:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-26 06:16:11,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-26 06:16:11,653 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-10-26 06:16:11,653 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:16:11,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:16:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1030411556, now seen corresponding path program 5 times [2024-10-26 06:16:11,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:16:11,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074584035] [2024-10-26 06:16:11,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:16:11,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:16:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:16:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 157 proven. 62 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-26 06:16:14,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:16:14,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074584035] [2024-10-26 06:16:14,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074584035] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:16:14,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685370903] [2024-10-26 06:16:14,648 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-26 06:16:14,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:16:14,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:16:14,649 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-10-26 06:16:14,650 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-10-26 06:16:16,886 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-10-26 06:16:16,886 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 06:16:16,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 2921 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-10-26 06:16:16,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:16:16,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:16,964 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-10-26 06:16:16,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:16,980 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-10-26 06:16:16,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:16,997 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-10-26 06:16:17,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:17,119 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-10-26 06:16:17,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:17,142 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-10-26 06:16:17,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:17,185 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-10-26 06:16:17,211 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-10-26 06:16:17,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:17,366 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-10-26 06:16:17,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:17,397 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-10-26 06:16:17,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:17,445 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-10-26 06:16:17,472 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-10-26 06:16:17,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:17,903 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-10-26 06:16:18,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:18,044 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-10-26 06:16:18,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:18,209 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-10-26 06:16:18,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:18,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 16 treesize of output 11 [2024-10-26 06:16:18,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:18,332 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-10-26 06:16:18,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:18,361 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-10-26 06:16:18,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:18,610 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-10-26 06:16:18,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:18,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 06:16:18,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:18,828 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-10-26 06:16:18,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:18,868 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-10-26 06:16:18,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:18,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-10-26 06:16:18,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:18,943 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-10-26 06:16:19,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:19,196 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-10-26 06:16:19,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:19,265 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-10-26 06:16:19,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:19,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 06:16:19,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:19,474 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-10-26 06:16:19,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:19,538 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-10-26 06:16:19,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:19,573 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-10-26 06:16:19,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:19,863 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-10-26 06:16:19,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 37 [2024-10-26 06:16:20,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:20,020 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 23 treesize of output 16 [2024-10-26 06:16:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 209 proven. 203 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-26 06:16:20,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:16:20,265 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2143 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) 0)) (<= 1 |c_t2Thread1of1ForFork1_dequeue_~x~0#1|)) is different from false [2024-10-26 06:16:20,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:16:20,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 72 [2024-10-26 06:16:20,819 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_arrayElimArr_11))) (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 (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0) (not (= 400 (select (select .cse0 |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))))) is different from false [2024-10-26 06:16:20,856 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11))) (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|) (+ 1600 |c_~#queue~0.offset|)))) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0))))) is different from false [2024-10-26 06:16:20,924 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2136 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_2136))) (let ((.cse2 (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11))) (let ((.cse1 (store (select .cse2 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|))) (or (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0) (not (= 400 (select (select (store .cse2 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))))))) is different from false [2024-10-26 06:16:21,023 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11))) (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|) (+ 1600 |c_~#queue~0.offset|)))) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0))))) is different from false [2024-10-26 06:16:21,047 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_81| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11))) (let ((.cse1 (store (select .cse0 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|))) (or (not (= 400 (select (select (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0))))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-26 06:16:21,075 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_2143 (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_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400)) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |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_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0)))) is different from false [2024-10-26 06:16:21,106 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_ArrVal_2133))) (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_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0) (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))))))) is different from false [2024-10-26 06:16:21,210 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (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_2133) |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_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |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_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-26 06:16:21,309 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2130 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_2130))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store .cse0 |c_~#queue~0.base| v_ArrVal_2133) |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_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0))))) is different from false [2024-10-26 06:16:21,473 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (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_2133) |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_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |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_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 12)) 0)))) is different from false [2024-10-26 06:16:21,520 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_82| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (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_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |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_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1))))) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-26 06:16:21,581 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (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_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1))))) is different from false [2024-10-26 06:16:21,646 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_ArrVal_2127))) (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_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)))))) is different from false [2024-10-26 06:16:21,850 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (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_2127) |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_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |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_2143) |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_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1))))) is different from false [2024-10-26 06:16:22,047 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2124 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_2124))) (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_2127) |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_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)))))) is different from false [2024-10-26 06:16:22,316 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (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_2127) |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_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1))))) is different from false [2024-10-26 06:16:22,465 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_83| Int)) (or (< |v_t1Thread1of1ForFork0_~i~0#1_83| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (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_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1))))))) is different from false [2024-10-26 06:16:22,648 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (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_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_83| (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1))))) is different from false [2024-10-26 06:16:22,818 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (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_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_83| (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1))))) is different from false [2024-10-26 06:16:22,873 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~value~0#1_71| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (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 (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_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_71|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_83| (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1))))) is different from false [2024-10-26 06:16:22,945 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (|v_t1Thread1of1ForFork0_~value~0#1_71| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_ArrVal_2121))) (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_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_71|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_83| (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (not (= (select (select (store (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400)) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1)))))) is different from false [2024-10-26 06:16:23,200 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (|v_t1Thread1of1ForFork0_~value~0#1_71| 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_2121) |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_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_71|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_83| (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1))))) is different from false [2024-10-26 06:16:23,321 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (|v_t1Thread1of1ForFork0_~value~0#1_71| 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_2121) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_71|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_83| 3) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1))))) is different from false [2024-10-26 06:16:23,488 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (|v_t1Thread1of1ForFork0_~value~0#1_71| Int) (v_ArrVal_2118 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_2118)) |c_~#queue~0.base| v_ArrVal_2121) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_71|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_83| 3) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1))))) is different from false [2024-10-26 06:16:23,583 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (|v_t1Thread1of1ForFork0_~value~0#1_71| Int) (v_ArrVal_2118 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_ArrVal_2116))) (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_2118)) |c_~#queue~0.base| v_ArrVal_2121) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_71|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_83| 3) (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1)))))) is different from false [2024-10-26 06:16:23,945 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_194| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (|v_t1Thread1of1ForFork0_~value~0#1_71| Int) (v_ArrVal_2118 Int)) (let ((.cse0 (store |c_#memory_int| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_194| v_ArrVal_2116))) (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_2118)) |c_~#queue~0.base| v_ArrVal_2121) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_71|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_83| 3) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_194| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1)))))) is different from false [2024-10-26 06:16:24,379 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2113 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_194| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (|v_t1Thread1of1ForFork0_~value~0#1_71| Int) (v_ArrVal_2118 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| v_ArrVal_2113) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_194| v_ArrVal_2116))) (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_2118)) |c_~#queue~0.base| v_ArrVal_2121) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_71|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_83| 3) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_194| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1)))))) is different from false [2024-10-26 06:16:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 243 not checked. [2024-10-26 06:16:24,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685370903] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:16:24,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:16:24,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 31, 40] total 84 [2024-10-26 06:16:24,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172220923] [2024-10-26 06:16:24,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:16:24,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2024-10-26 06:16:24,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:16:24,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2024-10-26 06:16:24,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=2923, Unknown=34, NotChecked=3836, Total=7140 [2024-10-26 06:16:24,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:16:24,494 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:16:24,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 5.929411764705883) internal successors, (504), 84 states have internal predecessors, (504), 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-10-26 06:16:24,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:24,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:16:24,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:24,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:24,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-26 06:16:24,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-10-26 06:16:24,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:16:31,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:16:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:16:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:16:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:16:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:16:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:16:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:16:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-26 06:16:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:16:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:16:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:16:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:16:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-26 06:16:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-26 06:16:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-26 06:16:31,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-26 06:16:31,904 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-10-26 06:16:31,904 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:16:31,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:16:31,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1827593053, now seen corresponding path program 1 times [2024-10-26 06:16:31,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:16:31,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218688582] [2024-10-26 06:16:31,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:16:31,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:16:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:16:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-26 06:16:32,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:16:32,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218688582] [2024-10-26 06:16:32,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218688582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 06:16:32,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 06:16:32,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-26 06:16:32,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166118871] [2024-10-26 06:16:32,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 06:16:32,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 06:16:32,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:16:32,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 06:16:32,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 06:16:32,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:16:32,040 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:16:32,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:16:32,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:32,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-26 06:16:32,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-10-26 06:16:32,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-10-26 06:16:32,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:16:36,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-26 06:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:16:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:16:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:16:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:16:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-26 06:16:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-26 06:16:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-10-26 06:16:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:16:36,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-26 06:16:36,802 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:16:36,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:16:36,803 INFO L85 PathProgramCache]: Analyzing trace with hash -14067297, now seen corresponding path program 6 times [2024-10-26 06:16:36,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:16:36,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597527589] [2024-10-26 06:16:36,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:16:36,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:16:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:16:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 194 proven. 151 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-10-26 06:16:42,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:16:42,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597527589] [2024-10-26 06:16:42,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597527589] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:16:42,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409759024] [2024-10-26 06:16:42,943 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-26 06:16:42,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:16:42,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:16:42,944 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-10-26 06:16:42,945 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-10-26 06:16:54,220 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-10-26 06:16:54,220 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 06:16:54,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 2731 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-10-26 06:16:54,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:16:55,057 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-10-26 06:16:55,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:55,095 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-10-26 06:16:55,243 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-10-26 06:16:55,289 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-10-26 06:16:55,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:55,453 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-10-26 06:16:55,493 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-10-26 06:16:55,579 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-10-26 06:16:55,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:55,628 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-10-26 06:16:55,769 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-10-26 06:16:55,822 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-10-26 06:16:55,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:55,992 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-10-26 06:16:56,028 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-10-26 06:16:56,118 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-10-26 06:16:56,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:16:56,165 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-10-26 06:16:56,260 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-10-26 06:16:56,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-10-26 06:16:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 194 proven. 151 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-10-26 06:16:56,461 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:16:56,973 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2576 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2576 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-10-26 06:16:56,987 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_2576 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2576 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-10-26 06:16:57,073 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_2572 Int) (v_ArrVal_2576 (Array Int 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_2572) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2572 Int) (v_ArrVal_2576 (Array Int 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_2572) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2024-10-26 06:19:11,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:19:11,454 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 386 treesize of output 286 [2024-10-26 06:19:11,531 INFO L349 Elim1Store]: treesize reduction 105, result has 53.5 percent of original size [2024-10-26 06:19:11,532 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 397 treesize of output 407 [2024-10-26 06:19:11,546 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-10-26 06:19:11,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:19:11,571 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 104 treesize of output 98 [2024-10-26 06:19:11,585 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-10-26 06:19:11,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:19:11,603 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 25 treesize of output 25 [2024-10-26 06:19:11,625 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-10-26 06:19:11,629 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-10-26 06:19:11,637 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,646 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-26 06:19:11,646 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 154 treesize of output 1 [2024-10-26 06:19:11,653 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,660 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-26 06:19:11,660 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 69 treesize of output 1 [2024-10-26 06:19:11,666 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,674 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-26 06:19:11,674 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 69 treesize of output 1 [2024-10-26 06:19:11,696 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:19:11,703 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:19:11,713 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 69 treesize of output 65 [2024-10-26 06:19:11,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 8 treesize of output 4 [2024-10-26 06:19:11,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:19:11,747 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 25 treesize of output 25 [2024-10-26 06:19:11,777 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:19:11,782 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,784 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:19:11,794 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 37 [2024-10-26 06:19:11,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-26 06:19:11,810 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-10-26 06:19:11,824 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:19:11,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-10-26 06:19:11,848 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,851 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:19:11,869 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,873 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:19:11,881 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,884 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:19:11,889 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,892 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:19:11,911 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,914 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:19:11,922 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,925 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:19:11,932 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,936 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:19:11,964 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:19:11,970 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,971 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,971 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,981 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-26 06:19:11,982 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 1 [2024-10-26 06:19:11,993 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:11,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:19:11,999 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:12,000 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:12,001 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:12,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:19:12,010 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 23 [2024-10-26 06:19:12,014 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:19:12,021 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:12,022 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:12,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:19:12,027 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:12,027 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:12,027 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:12,028 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:12,028 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:12,028 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:12,029 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:12,039 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-26 06:19:12,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 1 [2024-10-26 06:19:12,054 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:12,057 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:19:12,062 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:12,065 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:19:12,069 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:12,071 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:19:12,076 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:19:12,078 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:19:12,089 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-10-26 06:19:12,089 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 389 treesize of output 1 [2024-10-26 06:19:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 12 proven. 264 refuted. 54 times theorem prover too weak. 79 trivial. 15 not checked. [2024-10-26 06:19:21,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409759024] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:19:21,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:19:21,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 28] total 60 [2024-10-26 06:19:21,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170721490] [2024-10-26 06:19:21,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:19:21,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-10-26 06:19:21,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:19:21,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-10-26 06:19:21,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=524, Invalid=2759, Unknown=151, NotChecked=348, Total=3782 [2024-10-26 06:19:21,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:19:21,054 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:19:21,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 8.0) internal successors, (488), 61 states have internal predecessors, (488), 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-10-26 06:19:21,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:19:21,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:19:21,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:19:21,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:19:21,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:19:21,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:19:21,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:19:21,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:19:21,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:19:28,582 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-10-26 06:19:30,603 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse11 (select .cse7 .cse1)) (.cse3 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse16 (< .cse3 (+ |c_~#queue~0.offset| 1612))) (.cse2 (* .cse11 4)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse19 .cse20 (+ (select .cse19 .cse20) 1)))))) (and (forall ((v_ArrVal_2576 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse1) 4)))) (<= |c_~#stored_elements~0.base| 4) (= |c_~#queue~0.offset| 0) (<= (+ .cse2 |c_~#queue~0.offset| 4) .cse3) (= 5 |c_~#queue~0.base|) (or (let ((.cse8 (+ 1600 |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_168| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_165| Int) (v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2564 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (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_168| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse7 .cse8 .cse9) .cse10 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_2564) .cse1 (+ (select (store (store (store .cse7 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse8 .cse9) .cse10 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2572 Int) (v_ArrVal_2576 (Array Int Int)) (v_subst_7 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_165| 4)) v_subst_7))) (store (store .cse4 .cse5 v_ArrVal_2572) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse1) 4)))) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_165|)))) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_168|))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_168| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_165| Int) (v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2564 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse14 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_168| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse7 .cse8 .cse14) .cse15 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_2564) .cse1 (+ (select (store (store (store .cse7 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse8 .cse14) .cse15 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2572 Int) (v_subst_8 Int) (v_ArrVal_2576 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse13 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_165| 4)) v_subst_8))) (store (store .cse12 .cse5 v_ArrVal_2572) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse1) 4) 4) .cse3)) (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_165|)))) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_168|))))) .cse16) (or (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_165| Int)) (or (forall ((v_ArrVal_2572 Int) (v_ArrVal_2576 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse17 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_165| 4)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse17 .cse5 v_ArrVal_2572) .cse1 (+ (select .cse17 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_165|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_165| Int)) (or (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_165|) (forall ((v_ArrVal_2572 Int) (v_ArrVal_2576 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse18 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_165| 4)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse18 .cse5 v_ArrVal_2572) .cse1 (+ (select .cse18 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse3))))) .cse16) (<= 0 (+ .cse2 |c_~#queue~0.offset|)) (= (select |c_#length| 5) 1612) (forall ((v_ArrVal_2576 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse1) 4)) .cse3)))))) is different from false [2024-10-26 06:19:49,145 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-10-26 06:19:51,251 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-10-26 06:19:57,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-26 06:20:16,511 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-10-26 06:20:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:20:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:20:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:20:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:20:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:20:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:20:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:20:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:20:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:20:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:20:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:20:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:20:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:20:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:20:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:20:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-26 06:20:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:20:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:20:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:20:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:20:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:20:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-26 06:20:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-10-26 06:20:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-10-26 06:20:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:20:21,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 06:20:21,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-26 06:20:21,437 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,SelfDestructingSolverStorable25 [2024-10-26 06:20:21,437 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:20:21,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:20:21,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1031623144, now seen corresponding path program 7 times [2024-10-26 06:20:21,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:20:21,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328189934] [2024-10-26 06:20:21,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:20:21,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:20:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:20:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3178 backedges. 2082 proven. 271 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2024-10-26 06:20:35,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:20:35,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328189934] [2024-10-26 06:20:35,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328189934] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:20:35,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89031187] [2024-10-26 06:20:35,078 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-26 06:20:35,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:20:35,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:20:35,079 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-10-26 06:20:35,080 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-10-26 06:20:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:20:35,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 4659 conjuncts, 144 conjuncts are in the unsatisfiable core [2024-10-26 06:20:35,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:20:36,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-26 06:20:36,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:20:36,688 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-10-26 06:20:36,814 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-10-26 06:20:36,864 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-10-26 06:20:37,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:20:37,008 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-10-26 06:20:37,039 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-10-26 06:20:37,167 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-10-26 06:20:37,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:20:37,215 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-10-26 06:20:37,351 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-10-26 06:20:37,403 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-10-26 06:20:37,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:20:37,555 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-10-26 06:20:37,577 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-10-26 06:20:37,668 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 23 treesize of output 3 [2024-10-26 06:20:37,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:20:37,707 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-10-26 06:20:37,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 23 treesize of output 11 [2024-10-26 06:20:37,961 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-10-26 06:20:38,202 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-10-26 06:20:38,202 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-10-26 06:20:38,238 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-10-26 06:20:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3178 backedges. 1888 proven. 94 refuted. 0 times theorem prover too weak. 1196 trivial. 0 not checked. [2024-10-26 06:20:38,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:20:38,411 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3227 (Array Int Int))) (not (= 400 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))) is different from false [2024-10-26 06:20:45,529 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| Int) (v_ArrVal_3217 Int) (v_ArrVal_3224 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| 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_3217)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3218) |c_~#queue~0.base|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 1) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4 v_ArrVal_3224) .cse5 1)) |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) .cse2))) (not (= 400 (select .cse1 .cse2))) (< (select .cse1 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213|) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_3217) (not (= 400 (select (store (store (store .cse1 .cse4 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 1) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5))))))) is different from false [2024-10-26 06:20:45,562 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| Int) (v_ArrVal_3217 Int) (v_ArrVal_3224 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_3217)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3218) |c_~#queue~0.base|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 1) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4 v_ArrVal_3224) .cse5 1)) |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) .cse2))) (not (= 400 (select .cse1 .cse2))) (< (select .cse1 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213|) (< (+ (select .cse6 .cse7) 1) v_ArrVal_3217) (not (= 400 (select (store (store (store .cse1 .cse4 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 1) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5)))))))) is different from false [2024-10-26 06:20:45,642 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| Int) (v_ArrVal_3217 Int) (v_ArrVal_3215 Int) (v_ArrVal_3224 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3215) .cse7 v_ArrVal_3217)))) (let ((.cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_3218) |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 1) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4))) (not (= 400 (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 1) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1 v_ArrVal_3224) .cse4 1)) |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) .cse2))) (not (= 400 (select .cse0 .cse2))) (< (select .cse0 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213|) (< (+ (select .cse6 .cse7) 1) v_ArrVal_3217)))))) is different from false [2024-10-26 06:20:45,711 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| Int) (v_ArrVal_3217 Int) (v_ArrVal_3215 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_139| Int) (v_ArrVal_3224 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| 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|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3215) .cse7 v_ArrVal_3217)))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|)) (.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_3218) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select .cse0 .cse1))) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 1) .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse4 v_ArrVal_3224) .cse5 1)) |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) .cse1))) (not (= 400 (select (store (store (store .cse0 .cse4 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 1) .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse5))) (< (select .cse0 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213|) (< (+ (select .cse6 .cse7) 1) v_ArrVal_3217)))))) is different from false [2024-10-26 06:20:45,760 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216| 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_216|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| Int) (v_ArrVal_3217 Int) (v_ArrVal_3215 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_139| Int) (v_ArrVal_3224 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3215) .cse1 v_ArrVal_3217)))) (let ((.cse2 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_3218) |c_~#queue~0.base|)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213|) (not (= 400 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse5 1) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse7 v_ArrVal_3224) .cse3 1)) |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) .cse5))) (not (= 400 (select .cse2 .cse5))) (not (= 400 (select (store (store (store .cse2 .cse7 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 1) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse3))) (< (+ 1 (select .cse8 .cse1)) v_ArrVal_3217))))))))) is different from false [2024-10-26 06:21:02,280 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_164| Int) (v_ArrVal_3217 Int) (v_ArrVal_3215 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_139| Int) (v_ArrVal_3224 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3210 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| Int) (v_ArrVal_3227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216| Int) (v_ArrVal_3218 (Array Int Int))) (let ((.cse8 (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|))))) (let ((.cse2 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_3210) |c_~#queue~0.base|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse5 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216| 4) |c_~#queue~0.offset|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse2 .cse4 .cse5) .cse6 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse3 v_ArrVal_3215) .cse1 v_ArrVal_3217)) |c_~#stored_elements~0.base| v_ArrVal_3218) |c_~#queue~0.base|)) (.cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213|) (< (+ (select (store (store (store .cse2 .cse3 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse5) .cse6 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 1) v_ArrVal_3217) (not (= 400 (select (store (store (store .cse0 .cse3 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_164|)) .cse4 1) .cse7 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse1))) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216|) (not (= 400 (select .cse0 .cse4))) (not (= 400 (select (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse0 .cse4 1) .cse7 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse3 v_ArrVal_3224) .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) .cse4)))))))) is different from false [2024-10-26 06:21:06,789 WARN L851 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_164| Int) (v_ArrVal_3217 Int) (v_ArrVal_3215 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_139| Int) (v_ArrVal_3224 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3210 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| Int) (v_ArrVal_3227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216| Int) (v_ArrVal_3218 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (let ((.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_3210) |c_~#queue~0.base|)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse7 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216| 4) |c_~#queue~0.offset|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse6 .cse3 .cse7) .cse8 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_3215) .cse1 v_ArrVal_3217)) |c_~#stored_elements~0.base| v_ArrVal_3218) |c_~#queue~0.base|)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213|) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse0 .cse3 1) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse5 v_ArrVal_3224) .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) .cse3))) (not (= 400 (select .cse0 .cse3))) (not (= 400 (select (store (store (store .cse0 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_164|)) .cse3 1) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse1))) (< (+ (select (store (store (store .cse6 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse7) .cse8 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 1) v_ArrVal_3217) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216|))))))) is different from false [2024-10-26 06:21:12,799 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_219| Int)) (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse10 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_219| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse0 (select .cse10 .cse11))) (or (= 400 .cse0) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_164| Int) (v_ArrVal_3206 Int) (v_ArrVal_3217 Int) (v_ArrVal_3215 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_139| Int) (v_ArrVal_3224 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_142| Int) (v_ArrVal_3210 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| Int) (v_ArrVal_3227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216| Int) (v_ArrVal_3218 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3206) .cse11 (+ .cse0 1))))) (let ((.cse7 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_3210) |c_~#queue~0.base|)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216| 4) |c_~#queue~0.offset|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|)) (.cse2 (select (store (store .cse1 |c_~#queue~0.base| (store (store (store (store .cse7 .cse3 .cse8) .cse9 |v_t1Thread1of1ForFork0_enqueue_~x#1_142|) .cse5 v_ArrVal_3215) .cse6 v_ArrVal_3217)) |c_~#stored_elements~0.base| v_ArrVal_3218) |c_~#queue~0.base|))) (or (not (= (select (select (store (store .cse1 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 1) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse5 v_ArrVal_3224) .cse6 1)) |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) .cse3) 400)) (not (= 400 (select .cse2 .cse3))) (not (= (select (store (store (store .cse2 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_164|)) .cse3 1) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse6) 400)) (< (+ (select (store (store (store .cse7 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse8) .cse9 |v_t1Thread1of1ForFork0_enqueue_~x#1_142|) .cse6) 1) v_ArrVal_3217) (< (select .cse2 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213|) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216|)))))))))) (< (select .cse12 .cse11) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_219|)))) is different from false [2024-10-26 06:21:26,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:21:26,316 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 815 treesize of output 575 [2024-10-26 06:21:26,378 INFO L349 Elim1Store]: treesize reduction 40, result has 58.3 percent of original size [2024-10-26 06:21:26,379 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 1247 treesize of output 1111 [2024-10-26 06:21:26,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:21:26,434 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 484 treesize of output 470 [2024-10-26 06:21:26,450 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 55 treesize of output 51 [2024-10-26 06:21:26,464 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 125 treesize of output 113 [2024-10-26 06:21:26,481 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-10-26 06:21:26,558 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-10-26 06:21:26,684 INFO L349 Elim1Store]: treesize reduction 38, result has 42.4 percent of original size [2024-10-26 06:21:26,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 44 [2024-10-26 06:21:26,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:21:26,778 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 180 treesize of output 168 [2024-10-26 06:21:26,887 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-10-26 06:21:26,901 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:21:26,903 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-26 06:21:26,918 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:21:26,924 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 226 treesize of output 206 [2024-10-26 06:21:26,942 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:21:26,947 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 06:21:26,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:21:26,955 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 96 treesize of output 80 [2024-10-26 06:21:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3178 backedges. 1689 proven. 281 refuted. 85 times theorem prover too weak. 1067 trivial. 56 not checked. [2024-10-26 06:21:44,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89031187] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:21:44,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:21:44,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 41] total 83 [2024-10-26 06:21:44,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099970578] [2024-10-26 06:21:44,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:21:44,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2024-10-26 06:21:44,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:21:44,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2024-10-26 06:21:44,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1048, Invalid=4399, Unknown=139, NotChecked=1386, Total=6972 [2024-10-26 06:21:44,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:21:44,029 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:21:44,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 7.035714285714286) internal successors, (591), 83 states have internal predecessors, (591), 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-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:21:44,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:21:44,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:21:44,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:21:44,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:21:44,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-26 06:21:44,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-10-26 06:21:44,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-10-26 06:21:44,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:21:44,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-26 06:21:44,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:22:30,419 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-10-26 06:22:43,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:22:43,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:22:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:22:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-26 06:22:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-10-26 06:22:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-10-26 06:22:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:22:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-26 06:22:43,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-10-26 06:22:43,998 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-10-26 06:22:44,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:22:44,175 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:22:44,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:22:44,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2063787373, now seen corresponding path program 8 times [2024-10-26 06:22:44,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:22:44,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459870663] [2024-10-26 06:22:44,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:22:44,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:22:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:23:00,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 1886 proven. 262 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2024-10-26 06:23:00,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:23:00,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459870663] [2024-10-26 06:23:00,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459870663] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:23:00,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346266540] [2024-10-26 06:23:00,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 06:23:00,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:23:00,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:23:00,872 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-10-26 06:23:00,921 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-10-26 06:23:02,430 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 06:23:02,430 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 06:23:02,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 4469 conjuncts, 144 conjuncts are in the unsatisfiable core [2024-10-26 06:23:02,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:23:02,547 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-10-26 06:23:02,605 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-10-26 06:23:02,805 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-10-26 06:23:02,832 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-10-26 06:23:02,929 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-10-26 06:23:02,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:23:02,982 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-10-26 06:23:03,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:23:03,168 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-10-26 06:23:03,194 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-10-26 06:23:03,296 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-10-26 06:23:03,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:23:03,346 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-10-26 06:23:03,609 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-10-26 06:23:03,658 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-10-26 06:23:03,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:23:03,849 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-10-26 06:23:03,878 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-10-26 06:23:03,993 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-10-26 06:23:04,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:23:04,048 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-10-26 06:23:04,192 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-10-26 06:23:04,231 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-10-26 06:23:04,356 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-10-26 06:23:04,375 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-10-26 06:23:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 939 proven. 73 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2024-10-26 06:23:04,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:23:04,926 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1))))) is different from false [2024-10-26 06:23:05,098 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (Array Int Int)) (v_ArrVal_3828 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (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 (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3828) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1))))) is different from false [2024-10-26 06:23:05,117 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_177| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3828 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (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|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3828) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_177|)) .cse1))))) is different from false [2024-10-26 06:23:05,136 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| 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_274|) (forall ((v_ArrVal_3831 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_177| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3828 Int)) (not (= 400 (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3828) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_177|)) .cse3)))))))) is different from false [2024-10-26 06:23:07,014 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| Int) (v_ArrVal_3820 Int) (v_ArrVal_3831 (Array Int Int)) (v_ArrVal_3823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_177| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3828 Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3820) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_3823) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274|) (not (= 400 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_3828) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_177|)) .cse1))))))) is different from false [2024-10-26 06:23:07,054 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_180| Int) (v_ArrVal_3820 Int) (v_ArrVal_3831 (Array Int Int)) (v_ArrVal_3823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_177| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3828 Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (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|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3820) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_3823) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274|) (not (= 400 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_180|))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_3828) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_177|)) .cse1))))))) is different from false [2024-10-26 06:23:07,091 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_180| Int) (v_ArrVal_3820 Int) (v_ArrVal_3831 (Array Int Int)) (v_ArrVal_3823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_177| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3828 Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3820) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_3823) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274|) (not (= 400 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_180|))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_3828) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_177|)) .cse1))))))) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277|)))) is different from false [2024-10-26 06:23:08,433 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3815 Int) (v_ArrVal_3817 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_180| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277| Int) (v_ArrVal_3820 Int) (v_ArrVal_3831 (Array Int Int)) (v_ArrVal_3823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_177| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3828 Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3815) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_3817) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse6 v_ArrVal_3820) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3823) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274|) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_180|))) (store (store .cse5 .cse6 v_ArrVal_3828) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_177|)) .cse1)))))))) is different from false [2024-10-26 06:23:11,060 INFO L349 Elim1Store]: treesize reduction 306, result has 39.5 percent of original size [2024-10-26 06:23:11,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 1535 treesize of output 729 [2024-10-26 06:23:11,101 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-10-26 06:23:11,101 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 807 treesize of output 771 [2024-10-26 06:23:11,232 INFO L349 Elim1Store]: treesize reduction 68, result has 52.4 percent of original size [2024-10-26 06:23:11,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 793 treesize of output 688 [2024-10-26 06:23:11,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:23:11,279 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 922 treesize of output 918 [2024-10-26 06:23:11,345 INFO L349 Elim1Store]: treesize reduction 40, result has 29.8 percent of original size [2024-10-26 06:23:11,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 345 treesize of output 284 [2024-10-26 06:23:11,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:23:11,393 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 245 treesize of output 239 [2024-10-26 06:23:11,412 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 214 treesize of output 190 [2024-10-26 06:23:11,434 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 32 treesize of output 24 [2024-10-26 06:23:11,605 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-10-26 06:23:11,776 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-10-26 06:23:11,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:23:11,804 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 181 treesize of output 179 [2024-10-26 06:23:11,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 06:23:11,989 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 263 treesize of output 235 [2024-10-26 06:23:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 939 proven. 58 refuted. 1 times theorem prover too weak. 1741 trivial. 14 not checked. [2024-10-26 06:23:12,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346266540] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 06:23:12,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 06:23:12,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 22, 33] total 85 [2024-10-26 06:23:12,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333677053] [2024-10-26 06:23:12,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 06:23:12,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2024-10-26 06:23:12,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 06:23:12,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2024-10-26 06:23:12,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=768, Invalid=5188, Unknown=82, NotChecked=1272, Total=7310 [2024-10-26 06:23:12,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:23:12,193 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 06:23:12,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 5.848837209302325) internal successors, (503), 85 states have internal predecessors, (503), 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-10-26 06:23:12,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:12,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:23:12,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:12,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:12,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:12,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:12,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:23:12,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:23:12,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:23:12,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:23:12,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:23:12,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:12,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:12,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:12,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:23:12,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-10-26 06:23:12,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:23:12,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:23:12,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:23:12,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:23:12,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:12,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-26 06:23:12,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2024-10-26 06:23:12,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-10-26 06:23:12,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:12,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-10-26 06:23:12,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2024-10-26 06:23:12,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 06:23:26,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 06:23:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 06:23:26,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 06:23:26,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:26,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-26 06:23:26,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-10-26 06:23:26,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-10-26 06:23:26,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 06:23:26,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-26 06:23:26,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-10-26 06:23:26,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 06:23:26,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-26 06:23:26,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-26 06:23:26,592 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-26 06:23:26,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 06:23:26,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1127493040, now seen corresponding path program 1 times [2024-10-26 06:23:26,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 06:23:26,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797280578] [2024-10-26 06:23:26,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:23:26,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 06:23:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:23:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-26 06:23:34,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 06:23:34,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797280578] [2024-10-26 06:23:34,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797280578] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 06:23:34,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070705163] [2024-10-26 06:23:34,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 06:23:34,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 06:23:34,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 06:23:34,293 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 06:23:34,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-26 06:23:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 06:23:34,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 2548 conjuncts, 151 conjuncts are in the unsatisfiable core [2024-10-26 06:23:34,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 06:23:34,909 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-10-26 06:23:34,968 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-10-26 06:23:35,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:23:35,225 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-10-26 06:23:35,270 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-10-26 06:23:35,382 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-10-26 06:23:35,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:23:35,462 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-10-26 06:23:35,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:23:35,705 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-10-26 06:23:35,735 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-10-26 06:23:35,858 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-10-26 06:23:35,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:23:35,933 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-10-26 06:23:36,272 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-10-26 06:23:36,344 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-10-26 06:23:36,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:23:36,578 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-10-26 06:23:36,619 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-10-26 06:23:36,750 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-10-26 06:23:36,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:23:36,822 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-10-26 06:23:37,016 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-10-26 06:23:37,072 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-10-26 06:23:37,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:23:37,306 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-10-26 06:23:37,338 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-10-26 06:23:37,455 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-10-26 06:23:37,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 06:23:37,535 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-10-26 06:23:37,761 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-10-26 06:23:37,805 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-10-26 06:23:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-26 06:23:37,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 06:23:49,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_4047 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_4047 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-10-26 06:23:49,590 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_4047 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_4047 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2024-10-26 06:23:49,603 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_4047 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_4047 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-10-26 06:23:49,636 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_4047 (Array Int Int)) (v_ArrVal_4043 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_4043) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_4047 (Array Int Int)) (v_ArrVal_4043 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_4043) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2024-10-26 06:23:49,670 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_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 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_4043) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse5) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 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_4043) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse5) 4)))))) is different from false [2024-10-26 06:23:49,729 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 ((.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select .cse4 .cse3))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|) (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse1 .cse2 v_ArrVal_4043) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int)) (or (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse6 .cse2 v_ArrVal_4043) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|)))))) is different from false [2024-10-26 06:23:52,792 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse6 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int)) (let ((.cse2 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse5 .cse6 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|) (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse3 .cse4 v_ArrVal_4043) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int)) (let ((.cse7 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse5 .cse6 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= 0 (+ (* (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse8 .cse4 v_ArrVal_4043) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|))))))) is different from false [2024-10-26 06:24:22,161 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse6 (select .cse0 .cse5))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (or (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4 v_ArrVal_4043) .cse5 (+ (select (store (store (store .cse0 .cse4 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse2) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (or (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= 0 (+ (* (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_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse1 .cse7) .cse8 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4 v_ArrVal_4043) .cse5 (+ (select (store (store (store .cse0 .cse4 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 .cse7) .cse8 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|)))))) is different from false [2024-10-26 06:24:22,343 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_4039 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4039) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|) (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= (+ (* (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_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_4043) .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_4047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_4039 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4039) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= 0 (+ (* (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_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse6 .cse2 .cse7) .cse8 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_4043) .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_4047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|)))))) is different from false [2024-10-26 06:24:24,986 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1)))))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_4039 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_4039) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_4043) .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_4047) |c_~#queue~0.base|) .cse6) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse1 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_4039 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse7 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_4039) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse8 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse7 .cse2 .cse8) .cse9 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_4043) .cse6 (+ (select (store (store (store .cse7 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse8) .cse9 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse6) 4)))) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|)))))) is different from false [2024-10-26 06:24:28,784 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse11 .cse10)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 1604)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_4039 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (v_ArrVal_4035 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse8 .cse9 v_ArrVal_4035) .cse10 (+ (select .cse8 .cse10) 1)))))) (let ((.cse2 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_4039) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_4047 (Array Int Int)) (v_subst_9 Int) (v_ArrVal_4043 Int)) (<= (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse3 .cse4) .cse5 v_subst_9) .cse6 v_ArrVal_4043) .cse7 (+ (select (store (store (store .cse2 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse4) .cse5 v_subst_9) .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse2 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_4039 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (v_ArrVal_4035 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse16 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse16 .cse9 v_ArrVal_4035) .cse10 (+ (select .cse16 .cse10) 1)))))) (let ((.cse13 (select (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_4039) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_4047 (Array Int Int)) (v_subst_10 Int) (v_ArrVal_4043 Int)) (<= 0 (+ (* (select (select (store (store .cse12 |c_~#queue~0.base| (let ((.cse14 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse13 .cse3 .cse14) .cse15 v_subst_10) .cse6 v_ArrVal_4043) .cse7 (+ (select (store (store (store .cse13 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse14) .cse15 v_subst_10) .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset|))) (< (select .cse13 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|)))))))))) is different from false Killed by 15