/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONLY_ONE_CEGAR --traceabstraction.abstraction.used.for.commutativity.in.por VARIABLES_GLOBAL -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-e2ee32c-m [2023-09-08 06:40:05,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-08 06:40:05,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-09-08 06:40:05,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-08 06:40:05,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-08 06:40:05,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-08 06:40:05,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-08 06:40:05,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-08 06:40:05,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-08 06:40:05,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-08 06:40:05,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-08 06:40:05,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-08 06:40:05,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-08 06:40:05,811 INFO L153 SettingsManager]: * Use SBE=true [2023-09-08 06:40:05,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-08 06:40:05,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-08 06:40:05,812 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-08 06:40:05,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-08 06:40:05,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-08 06:40:05,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-08 06:40:05,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-08 06:40:05,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-08 06:40:05,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-08 06:40:05,814 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-08 06:40:05,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-08 06:40:05,814 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-08 06:40:05,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-08 06:40:05,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-08 06:40:05,815 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-08 06:40:05,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-08 06:40:05,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 06:40:05,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-08 06:40:05,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-08 06:40:05,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-08 06:40:05,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-08 06:40:05,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-08 06:40:05,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-08 06:40:05,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-08 06:40:05,817 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-08 06:40:05,817 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-09-08 06:40:05,817 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/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONLY_ONE_CEGAR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR -> VARIABLES_GLOBAL [2023-09-08 06:40:06,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-08 06:40:06,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-08 06:40:06,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-08 06:40:06,038 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-08 06:40:06,039 INFO L274 PluginConnector]: CDTParser initialized [2023-09-08 06:40:06,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2023-09-08 06:40:07,199 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-08 06:40:07,496 INFO L384 CDTParser]: Found 1 translation units. [2023-09-08 06:40:07,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2023-09-08 06:40:07,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ea727b23/0e10c308df604348bb6b6333876c0675/FLAG37a1e63cc [2023-09-08 06:40:07,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ea727b23/0e10c308df604348bb6b6333876c0675 [2023-09-08 06:40:07,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-08 06:40:07,532 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-08 06:40:07,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-08 06:40:07,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-08 06:40:07,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-08 06:40:07,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:40:07" (1/1) ... [2023-09-08 06:40:07,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1500db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:07, skipping insertion in model container [2023-09-08 06:40:07,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:40:07" (1/1) ... [2023-09-08 06:40:07,609 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-08 06:40:07,954 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2023-09-08 06:40:07,960 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2023-09-08 06:40:07,972 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2023-09-08 06:40:07,982 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 06:40:07,994 INFO L202 MainTranslator]: Completed pre-run [2023-09-08 06:40:08,024 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-08 06:40:08,026 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-09-08 06:40:08,050 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-09-08 06:40:08,064 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2023-09-08 06:40:08,065 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2023-09-08 06:40:08,068 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2023-09-08 06:40:08,070 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 06:40:08,115 INFO L206 MainTranslator]: Completed translation [2023-09-08 06:40:08,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:08 WrapperNode [2023-09-08 06:40:08,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-08 06:40:08,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-08 06:40:08,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-08 06:40:08,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-08 06:40:08,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:08" (1/1) ... [2023-09-08 06:40:08,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:08" (1/1) ... [2023-09-08 06:40:08,163 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2023-09-08 06:40:08,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-08 06:40:08,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-08 06:40:08,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-08 06:40:08,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-08 06:40:08,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:08" (1/1) ... [2023-09-08 06:40:08,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:08" (1/1) ... [2023-09-08 06:40:08,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:08" (1/1) ... [2023-09-08 06:40:08,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:08" (1/1) ... [2023-09-08 06:40:08,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:08" (1/1) ... [2023-09-08 06:40:08,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:08" (1/1) ... [2023-09-08 06:40:08,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:08" (1/1) ... [2023-09-08 06:40:08,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:08" (1/1) ... [2023-09-08 06:40:08,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-08 06:40:08,198 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-08 06:40:08,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-08 06:40:08,198 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-08 06:40:08,199 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:08" (1/1) ... [2023-09-08 06:40:08,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 06:40:08,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 06:40:08,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-08 06:40:08,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-08 06:40:08,256 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-09-08 06:40:08,257 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-09-08 06:40:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-09-08 06:40:08,257 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-09-08 06:40:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-08 06:40:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-08 06:40:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-08 06:40:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-08 06:40:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-08 06:40:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-08 06:40:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-08 06:40:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-08 06:40:08,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-08 06:40:08,259 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-08 06:40:08,388 INFO L236 CfgBuilder]: Building ICFG [2023-09-08 06:40:08,390 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-08 06:40:08,680 INFO L277 CfgBuilder]: Performing block encoding [2023-09-08 06:40:08,688 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-08 06:40:08,689 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-08 06:40:08,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:40:08 BoogieIcfgContainer [2023-09-08 06:40:08,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-08 06:40:08,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-08 06:40:08,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-08 06:40:08,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-08 06:40:08,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:40:07" (1/3) ... [2023-09-08 06:40:08,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fd06aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:40:08, skipping insertion in model container [2023-09-08 06:40:08,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:08" (2/3) ... [2023-09-08 06:40:08,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fd06aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:40:08, skipping insertion in model container [2023-09-08 06:40:08,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:40:08" (3/3) ... [2023-09-08 06:40:08,704 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2023-09-08 06:40:08,711 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-08 06:40:08,717 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-08 06:40:08,717 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-09-08 06:40:08,717 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-08 06:40:08,830 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-08 06:40:08,881 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 06:40:08,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-08 06:40:08,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 06:40:08,885 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-08 06:40:08,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-09-08 06:40:08,925 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-08 06:40:08,932 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-08 06:40:08,967 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@60111616, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 06:40:08,968 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-08 06:40:09,018 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 06:40:09,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:09,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1389819344, now seen corresponding path program 1 times [2023-09-08 06:40:09,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:09,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762287443] [2023-09-08 06:40:09,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:09,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:09,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 06:40:09,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:09,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762287443] [2023-09-08 06:40:09,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762287443] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 06:40:09,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 06:40:09,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-08 06:40:09,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255651540] [2023-09-08 06:40:09,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 06:40:09,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-08 06:40:09,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:09,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-08 06:40:09,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-08 06:40:09,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:09,327 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:09,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 06:40:09,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:09,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:09,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-08 06:40:09,490 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 06:40:09,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:09,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1534507384, now seen corresponding path program 1 times [2023-09-08 06:40:09,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:09,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859848312] [2023-09-08 06:40:09,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:09,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 06:40:09,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:09,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859848312] [2023-09-08 06:40:09,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859848312] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 06:40:09,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 06:40:09,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-08 06:40:09,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128975038] [2023-09-08 06:40:09,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 06:40:09,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-08 06:40:09,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:09,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-08 06:40:09,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-08 06:40:09,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:09,788 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:09,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 06:40:09,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:09,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:09,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:09,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:40:09,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-08 06:40:09,889 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 06:40:09,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:09,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1870236260, now seen corresponding path program 1 times [2023-09-08 06:40:09,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:09,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846230322] [2023-09-08 06:40:09,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:09,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 06:40:12,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:12,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846230322] [2023-09-08 06:40:12,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846230322] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 06:40:12,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 06:40:12,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-09-08 06:40:12,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025834460] [2023-09-08 06:40:12,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 06:40:12,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-09-08 06:40:12,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:12,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-09-08 06:40:12,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-09-08 06:40:12,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:12,195 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:12,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 06:40:12,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:12,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:40:12,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:13,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:13,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:40:13,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 06:40:13,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-08 06:40:13,113 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 06:40:13,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:13,113 INFO L85 PathProgramCache]: Analyzing trace with hash 934072322, now seen corresponding path program 1 times [2023-09-08 06:40:13,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:13,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655684034] [2023-09-08 06:40:13,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:13,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 06:40:16,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:16,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655684034] [2023-09-08 06:40:16,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655684034] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 06:40:16,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 06:40:16,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-09-08 06:40:16,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805220945] [2023-09-08 06:40:16,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 06:40:16,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-09-08 06:40:16,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:16,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-09-08 06:40:16,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2023-09-08 06:40:16,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:16,593 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:16,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.107142857142857) internal successors, (115), 28 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 06:40:16,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:16,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:40:16,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 06:40:16,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:19,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:19,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:40:19,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 06:40:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-09-08 06:40:19,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-08 06:40:19,165 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 06:40:19,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:19,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1713858353, now seen corresponding path program 1 times [2023-09-08 06:40:19,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:19,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5119662] [2023-09-08 06:40:19,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:19,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 06:40:19,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5119662] [2023-09-08 06:40:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5119662] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 06:40:19,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 06:40:19,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-08 06:40:19,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845870693] [2023-09-08 06:40:19,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 06:40:19,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-08 06:40:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:19,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-08 06:40:19,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-08 06:40:19,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:19,231 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:19,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 06:40:19,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:19,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:40:19,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 06:40:19,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-09-08 06:40:19,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:40:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 06:40:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-08 06:40:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:40:19,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-08 06:40:19,645 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 06:40:19,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:19,647 INFO L85 PathProgramCache]: Analyzing trace with hash -750593108, now seen corresponding path program 1 times [2023-09-08 06:40:19,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:19,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013110286] [2023-09-08 06:40:19,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:19,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:19,849 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-09-08 06:40:19,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:19,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013110286] [2023-09-08 06:40:19,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013110286] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 06:40:19,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 06:40:19,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-08 06:40:19,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022080740] [2023-09-08 06:40:19,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 06:40:19,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-08 06:40:19,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:19,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-08 06:40:19,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-08 06:40:19,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:19,853 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:19,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 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) [2023-09-08 06:40:19,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:19,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:40:19,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 06:40:19,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-09-08 06:40:19,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:40:19,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:40:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 06:40:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-08 06:40:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:40:19,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:19,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-08 06:40:19,895 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 06:40:19,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:19,896 INFO L85 PathProgramCache]: Analyzing trace with hash 494892714, now seen corresponding path program 2 times [2023-09-08 06:40:19,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:19,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021426568] [2023-09-08 06:40:19,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:19,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 06:40:25,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:25,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021426568] [2023-09-08 06:40:25,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021426568] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 06:40:25,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361127462] [2023-09-08 06:40:25,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-08 06:40:25,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 06:40:25,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 06:40:25,467 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-08 06:40:25,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-08 06:40:25,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-08 06:40:25,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 06:40:25,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 115 conjunts are in the unsatisfiable core [2023-09-08 06:40:25,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 06:40:25,903 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-09-08 06:40:25,904 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-09-08 06:40:25,976 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-08 06:40:25,977 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-09-08 06:40:26,218 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-08 06:40:26,327 INFO L351 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 19 treesize of output 18 [2023-09-08 06:40:27,015 INFO L351 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 21 treesize of output 21 [2023-09-08 06:40:27,149 INFO L351 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 21 treesize of output 21 [2023-09-08 06:40:27,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:40:27,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:40:27,582 INFO L351 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 28 treesize of output 30 [2023-09-08 06:40:27,652 INFO L351 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 26 treesize of output 28 [2023-09-08 06:40:27,933 INFO L351 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 [2023-09-08 06:40:28,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:40:28,066 INFO L351 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 21 treesize of output 21 [2023-09-08 06:40:28,691 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-09-08 06:40:28,692 INFO L351 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 35 treesize of output 33 [2023-09-08 06:40:28,746 INFO L351 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 26 treesize of output 28 [2023-09-08 06:40:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 06:40:28,866 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-08 06:40:28,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361127462] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 06:40:28,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-08 06:40:28,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [44] total 70 [2023-09-08 06:40:28,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114501142] [2023-09-08 06:40:28,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 06:40:28,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-09-08 06:40:28,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:40:28,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-09-08 06:40:28,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=4422, Unknown=0, NotChecked=0, Total=4830 [2023-09-08 06:40:28,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:28,871 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:40:28,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.413793103448276) internal successors, (186), 29 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 06:40:28,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:28,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:40:28,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 06:40:28,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-09-08 06:40:28,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:40:28,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:28,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:30,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:40:30,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:40:30,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 06:40:30,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-08 06:40:30,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:40:30,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:40:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-08 06:40:30,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-08 06:40:30,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-09-08 06:40:30,684 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 06:40:30,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:40:30,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1882119695, now seen corresponding path program 1 times [2023-09-08 06:40:30,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:40:30,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172609217] [2023-09-08 06:40:30,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:30,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:40:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 06:40:35,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:40:35,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172609217] [2023-09-08 06:40:35,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172609217] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 06:40:35,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534524369] [2023-09-08 06:40:35,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:40:35,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 06:40:35,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 06:40:35,701 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-08 06:40:35,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-08 06:40:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:40:35,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 123 conjunts are in the unsatisfiable core [2023-09-08 06:40:35,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 06:40:36,079 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-09-08 06:40:36,079 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-09-08 06:40:36,151 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-09-08 06:40:36,152 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-09-08 06:40:36,418 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-08 06:40:36,482 INFO L351 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 19 treesize of output 18 [2023-09-08 06:40:37,122 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-09-08 06:40:37,258 INFO L351 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 21 treesize of output 21 [2023-09-08 06:40:37,788 INFO L322 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-09-08 06:40:37,788 INFO L351 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 28 treesize of output 38 [2023-09-08 06:40:38,113 INFO L322 Elim1Store]: treesize reduction 31, result has 29.5 percent of original size [2023-09-08 06:40:38,113 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 58 [2023-09-08 06:40:38,397 INFO L351 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 51 treesize of output 34 [2023-09-08 06:40:38,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:40:38,554 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-09-08 06:40:39,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:40:39,285 INFO L322 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-09-08 06:40:39,285 INFO L351 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 37 treesize of output 49 [2023-09-08 06:40:39,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:40:39,445 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2023-09-08 06:40:39,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:40:39,749 INFO L351 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-09-08 06:40:39,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:40:39,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:40:39,831 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-09-08 06:40:40,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:40:40,456 INFO L322 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-09-08 06:40:40,457 INFO L351 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 44 treesize of output 48 [2023-09-08 06:40:40,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:40:40,707 INFO L351 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 21 treesize of output 21 [2023-09-08 06:40:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 06:40:40,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 06:40:41,125 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_t2Thread1of1ForFork1_dequeue_~x~0#1| 0)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|))) (and (or .cse0 (forall ((v_ArrVal_437 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_437) |c_~#stored_elements~0.base|) .cse1) 0)))) (or (not .cse0) (forall ((v_ArrVal_437 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_437) |c_~#stored_elements~0.base|) .cse1) 1)))))) is different from false [2023-09-08 06:40:48,775 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_423)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_427)))) (let ((.cse0 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_429) .cse2 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (= (select .cse1 .cse2) 800)))))) is different from false [2023-09-08 06:40:49,947 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |c_t1Thread1of1ForFork0_enqueue_~x#1|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_421) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_423)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse2)) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse0 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_429) .cse2 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (not (= 800 (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= 800 (select .cse1 .cse2)) (not (= 0 (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|)))))))) is different from false [2023-09-08 06:41:01,344 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_418 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (let ((.cse7 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_418))) (store .cse8 |c_~#queue~0.base| (store (store (store (select .cse8 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse5 v_ArrVal_421) .cse1 v_ArrVal_423))))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse0 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) v_ArrVal_427)))) (let ((.cse2 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_429) .cse1 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (= 800 (select .cse0 .cse1)) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (not (= 800 (select (select .cse2 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0))))))) is different from false [2023-09-08 06:41:01,690 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_418 (Array Int Int)) (v_ArrVal_417 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (let ((.cse7 (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_417) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_418))) (store .cse8 |c_~#queue~0.base| (store (store (store (select .cse8 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse5 v_ArrVal_421) .cse2 v_ArrVal_423))))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse2)) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse0 (let ((.cse3 (store .cse4 |c_~#queue~0.base| (store (store .cse1 .cse5 v_ArrVal_429) .cse2 v_ArrVal_431)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (not (= 800 (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (= 800 (select .cse1 .cse2)))))))) is different from false [2023-09-08 06:41:05,096 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (v_ArrVal_415 Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_418 (Array Int Int)) (v_ArrVal_417 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_415)))) (let ((.cse7 (let ((.cse10 (let ((.cse11 (store (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_417) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_418))) (store .cse11 |c_~#queue~0.base| (store (store (store (select .cse11 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse8 v_ArrVal_421) .cse1 v_ArrVal_423))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse5 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_427)))) (let ((.cse4 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_429) .cse1 v_ArrVal_431)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434)))) (.cse2 (+ 3200 |c_~#queue~0.offset|))) (or (not (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2)))) (not (= (select (select (store .cse4 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (not (= 800 (select (select .cse4 |c_~#queue~0.base|) .cse2))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (= 800 (select .cse5 .cse1)))))))) is different from false [2023-09-08 06:41:05,707 INFO L322 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2023-09-08 06:41:05,707 INFO L351 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 5 case distinctions, treesize of input 2932 treesize of output 2080 [2023-09-08 06:41:06,814 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 06:41:06,816 INFO L351 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 193577 treesize of output 191159 [2023-09-08 06:41:07,081 INFO L351 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 44154 treesize of output 43482 [2023-09-08 06:41:07,774 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-08 06:41:07,782 INFO L351 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 11083 treesize of output 11003 [2023-09-08 06:41:08,079 INFO L351 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 522 treesize of output 490 [2023-09-08 06:41:10,757 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-09-08 06:41:10,852 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-08 06:41:10,863 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-08 06:41:10,880 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-08 06:41:10,884 INFO L351 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 59 treesize of output 55 [2023-09-08 06:41:10,995 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 06:41:10,995 INFO L351 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 3596 treesize of output 3550 [2023-09-08 06:41:13,324 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 06:41:13,325 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 49 treesize of output 119 [2023-09-08 06:41:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 06:41:13,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534524369] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 06:41:13,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 06:41:13,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 45, 47] total 123 [2023-09-08 06:41:13,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277942470] [2023-09-08 06:41:13,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 06:41:13,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2023-09-08 06:41:13,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:41:13,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2023-09-08 06:41:13,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1017, Invalid=12468, Unknown=111, NotChecked=1410, Total=15006 [2023-09-08 06:41:13,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:41:13,770 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:41:13,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 123 states, 123 states have (on average 4.357723577235772) internal successors, (536), 123 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 06:41:13,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:41:13,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:41:13,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 06:41:13,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-09-08 06:41:13,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:41:13,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:41:13,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-09-08 06:41:13,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:41:25,693 WARN L234 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 91 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 06:41:31,937 WARN L234 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 82 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 06:41:35,266 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 3204)) (.cse22 (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|)) (.cse14 (select (select |c_#memory_int| 5) 3200))) (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (= .cse14 0)) (.cse2 (select .cse22 (+ |c_ULTIMATE.start_empty_~q#1.offset| 3204))) (.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse1 (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_418 (Array Int Int)) (v_ArrVal_417 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse27 (let ((.cse29 (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_417) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_418))) (store .cse30 |c_~#queue~0.base| (store (store (store (select .cse30 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse9 v_ArrVal_421) .cse6 v_ArrVal_423))))) (store .cse29 |c_~#stored_elements~0.base| (store (select .cse29 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse25 (let ((.cse28 (select .cse27 |c_~#queue~0.base|))) (store .cse28 (+ (* 4 (select .cse28 .cse6)) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse24 (let ((.cse26 (store .cse27 |c_~#queue~0.base| (store (store .cse25 .cse9 v_ArrVal_429) .cse6 v_ArrVal_431)))) (store .cse26 |c_~#stored_elements~0.base| (store (select .cse26 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= (select (select (store .cse24 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (not (= 800 (select (select .cse24 |c_~#queue~0.base|) .cse4))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (= 800 (select .cse25 .cse6))))))))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (or (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_empty_#in~q#1.offset| 3200)) (select .cse0 (+ |c_ULTIMATE.start_empty_#in~q#1.offset| 3204))))) .cse1) (not (= 5 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (or .cse1 (not (= .cse2 |c_ULTIMATE.start_empty_#t~mem31#1|))) (<= |c_~#stored_elements~0.base| 4) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= 5 |c_ULTIMATE.start_init_~q#1.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse8 (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store (store .cse12 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_421) (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204) v_ArrVal_423)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse5 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse6)) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse3 (let ((.cse7 (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_429) .cse6 v_ArrVal_431)))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= 800 (select (select .cse3 |c_~#queue~0.base|) .cse4))) (not (= 0 (select (select (store .cse3 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (= (select .cse5 .cse6) 800)))))) (or .cse1 (not (= |c_ULTIMATE.start_empty_#t~mem31#1| |c_ULTIMATE.start_empty_#t~mem32#1|))) (or .cse13 (= .cse14 |c_t1Thread1of1ForFork0_~value~0#1|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (<= (select .cse15 3204) 1) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse19 (let ((.cse21 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store .cse15 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_421) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_423)))) (store .cse21 |c_~#stored_elements~0.base| (store (select .cse21 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse17 (let ((.cse20 (select .cse19 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse16 (let ((.cse18 (store .cse19 |c_~#queue~0.base| (store (store .cse17 .cse9 v_ArrVal_429) .cse6 v_ArrVal_431)))) (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= (select (select (store .cse16 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (not (= 800 (select (select .cse16 |c_~#queue~0.base|) .cse4))) (= (select .cse17 .cse6) 800)))))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (not (= (select .cse15 3200) 800)) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (or (= .cse14 (select (select |c_#memory_int| |c_~#stored_elements~0.base|) 0)) .cse13) (= 5 |c_~#queue~0.base|) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= (select |c_#valid| 5) 1) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 0) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 5)) (= |c_~#stored_elements~0.offset| 0) (or .cse1 (not (= .cse2 (select .cse22 (+ |c_ULTIMATE.start_empty_~q#1.offset| 3200))))) (not (= (select .cse12 3200) 800)) (= 5 |c_ULTIMATE.start_init_#in~q#1.base|) (<= (select .cse12 3204) 1) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (or (not (let ((.cse23 (select |c_#memory_int| |c_~#queue~0.base|))) (= (select .cse23 .cse6) (select .cse23 .cse4)))) .cse1) (= 0 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) is different from true [2023-09-08 06:41:52,285 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse29 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse19 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse37 (select .cse18 .cse20))) (and (<= |c_~#stored_elements~0.base| 4) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse5 (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store (store .cse9 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|) .cse10 v_ArrVal_421) .cse11 v_ArrVal_423)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse2 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse3)) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse0 (let ((.cse4 (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_429) .cse3 v_ArrVal_431)))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= 800 (select (select .cse0 |c_~#queue~0.base|) .cse1))) (not (= 0 (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (= (select .cse2 .cse3) 800)))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse15 (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store .cse18 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|) .cse19 v_ArrVal_421) .cse20 v_ArrVal_423)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse13 (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_427)))) (let ((.cse12 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse13 .cse6 v_ArrVal_429) .cse3 v_ArrVal_431)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= (select (select (store .cse12 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0) (not (= 800 (select (select .cse12 |c_~#queue~0.base|) .cse1))) (= (select .cse13 .cse3) 800)))))) (forall ((v_ArrVal_423 Int) (v_ArrVal_434 Int) (v_ArrVal_421 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse24 (let ((.cse26 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse18 .cse19 v_ArrVal_421) .cse20 v_ArrVal_423)))) (store .cse26 |c_~#stored_elements~0.base| (store (select .cse26 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse22 (let ((.cse25 (select .cse24 |c_~#queue~0.base|))) (store .cse25 (+ |c_~#queue~0.offset| (* 4 (select .cse25 .cse3))) v_ArrVal_427)))) (let ((.cse21 (let ((.cse23 (store .cse24 |c_~#queue~0.base| (store (store .cse22 .cse6 v_ArrVal_429) .cse3 v_ArrVal_431)))) (store .cse23 |c_~#stored_elements~0.base| (store (select .cse23 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_434))))) (or (not (= 800 (select (select .cse21 |c_~#queue~0.base|) .cse1))) (= 800 (select .cse22 .cse3)) (not (= (select (select (store .cse21 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 0)))))) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int))) (let ((.cse27 (let ((.cse28 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse18 .cse20 v_ArrVal_431)))) (store .cse28 |c_~#stored_elements~0.base| (store (select .cse28 |c_~#stored_elements~0.base|) .cse29 v_ArrVal_434))))) (or (not (= (select (select .cse27 |c_~#queue~0.base|) .cse1) 800)) (not (= (select (select (store .cse27 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))))) (let ((.cse30 (select (select |c_#memory_int| 5) 3200))) (or (= .cse30 (select (select |c_#memory_int| |c_~#stored_elements~0.base|) 0)) (= .cse30 0))) (= 5 |c_~#queue~0.base|) (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int)) (let ((.cse31 (store .cse9 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 (select .cse9 .cse11))) v_ArrVal_427))) (let ((.cse32 (let ((.cse33 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse31 .cse10 v_ArrVal_429) .cse11 v_ArrVal_431)))) (store .cse33 |c_~#stored_elements~0.base| (store (select .cse33 |c_~#stored_elements~0.base|) .cse29 v_ArrVal_434))))) (or (= 800 (select .cse31 .cse11)) (not (= 800 (select (select .cse32 |c_~#queue~0.base|) .cse1))) (not (= (select (select (store .cse32 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)))))) (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int) (v_ArrVal_427 Int)) (let ((.cse35 (store .cse18 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* .cse37 4)) v_ArrVal_427))) (let ((.cse34 (let ((.cse36 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse35 .cse19 v_ArrVal_429) .cse20 v_ArrVal_431)))) (store .cse36 |c_~#stored_elements~0.base| (store (select .cse36 |c_~#stored_elements~0.base|) .cse29 v_ArrVal_434))))) (or (not (= (select (select (store .cse34 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)) (not (= (select (select .cse34 |c_~#queue~0.base|) .cse1) 800)) (= (select .cse35 .cse20) 800))))) (= |c_~#stored_elements~0.offset| 0) (or (forall ((v_ArrVal_434 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_429 Int)) (let ((.cse38 (let ((.cse39 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse18 .cse19 v_ArrVal_429) .cse20 v_ArrVal_431)))) (store .cse39 |c_~#stored_elements~0.base| (store (select .cse39 |c_~#stored_elements~0.base|) .cse29 v_ArrVal_434))))) (or (not (= 800 (select (select .cse38 |c_~#queue~0.base|) .cse1))) (not (= (select (select (store .cse38 |c_~#queue~0.base| v_ArrVal_437) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))))) (= 800 .cse37)) (not (= (select (select |c_#memory_int| |c_~#queue~0.base|) 3200) 800))))) is different from true [2023-09-08 06:42:00,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 06:42:04,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:42:04,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:42:04,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 06:42:04,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-08 06:42:04,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:42:04,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:42:04,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-08 06:42:04,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-09-08 06:42:04,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-09-08 06:42:04,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 06:42:04,553 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 06:42:04,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:42:04,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1703422451, now seen corresponding path program 1 times [2023-09-08 06:42:04,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:42:04,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140729414] [2023-09-08 06:42:04,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:42:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:42:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:42:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 06:42:04,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:42:04,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140729414] [2023-09-08 06:42:04,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140729414] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 06:42:04,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 06:42:04,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-08 06:42:04,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421892897] [2023-09-08 06:42:04,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 06:42:04,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-08 06:42:04,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 06:42:04,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-08 06:42:04,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-08 06:42:04,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:42:04,707 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 06:42:04,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 06:42:04,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:42:04,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:42:04,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-09-08 06:42:04,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-09-08 06:42:04,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:42:04,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:42:04,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-09-08 06:42:04,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2023-09-08 06:42:04,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:42:21,440 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] [2023-09-08 06:42:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 06:42:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:42:23,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-08 06:42:23,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-08 06:42:23,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 06:42:23,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:42:23,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-09-08 06:42:23,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-09-08 06:42:23,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-08 06:42:23,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-08 06:42:23,304 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-08 06:42:23,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 06:42:23,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1705847134, now seen corresponding path program 1 times [2023-09-08 06:42:23,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 06:42:23,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671566014] [2023-09-08 06:42:23,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:42:23,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 06:42:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:42:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-09-08 06:42:29,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 06:42:29,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671566014] [2023-09-08 06:42:29,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671566014] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 06:42:29,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419860942] [2023-09-08 06:42:29,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 06:42:29,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 06:42:29,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 06:42:29,812 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-08 06:42:29,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-08 06:42:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 06:42:29,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 132 conjunts are in the unsatisfiable core [2023-09-08 06:42:30,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 06:42:30,208 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-09-08 06:42:30,208 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-09-08 06:42:30,295 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-09-08 06:42:30,295 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-09-08 06:42:30,559 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-08 06:42:30,661 INFO L351 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 19 treesize of output 18 [2023-09-08 06:42:31,394 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-09-08 06:42:31,547 INFO L351 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 21 treesize of output 21 [2023-09-08 06:42:32,129 INFO L351 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 26 treesize of output 28 [2023-09-08 06:42:32,288 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-09-08 06:42:32,555 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-09-08 06:42:32,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:42:32,716 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2023-09-08 06:42:33,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:42:33,637 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2023-09-08 06:42:33,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:42:33,740 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2023-09-08 06:42:33,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:42:33,931 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2023-09-08 06:42:34,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:42:34,093 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2023-09-08 06:42:34,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:42:34,951 INFO L351 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 32 treesize of output 28 [2023-09-08 06:42:34,955 INFO L351 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 20 treesize of output 14 [2023-09-08 06:42:35,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 06:42:35,073 INFO L351 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 14 treesize of output 16 [2023-09-08 06:42:35,259 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-09-08 06:42:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-09-08 06:42:35,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 06:42:35,551 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_t2Thread1of1ForFork1_dequeue_~x~0#1| 0)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|))) (and (or .cse0 (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_634) |c_~#stored_elements~0.base|) .cse1) 0)))) (or (not .cse0) (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_634) |c_~#stored_elements~0.base|) .cse1) 1)))))) is different from false [2023-09-08 06:42:35,653 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_t2Thread1of1ForFork1_dequeue_#t~mem43#1| 0)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|))) (and (or (not .cse0) (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_634) |c_~#stored_elements~0.base|) .cse1) 1)))) (or .cse0 (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_634) |c_~#stored_elements~0.base|) .cse1) 0)))))) is different from false [2023-09-08 06:42:36,487 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_~#stored_elements~0.base|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_631 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse3 .cse4 v_ArrVal_631)))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))) (= (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (select .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)))) 0)))) (forall ((v_ArrVal_631 Int)) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse3 .cse4 v_ArrVal_631)))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse5 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1))) (not (= (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (select .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse2) 4)))) 0))))))) is different from false [2023-09-08 06:42:36,587 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int)) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_630)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1)))))) (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int)) (let ((.cse7 (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_630)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse7 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))) (= (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (select .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|))) 0)))))) is different from false [2023-09-08 06:42:36,729 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_627 Int)) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_627) .cse7 v_ArrVal_630)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1)))))) (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_627 Int)) (let ((.cse8 (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_627) .cse7 v_ArrVal_630)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse8 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))) (= (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (select .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)))) 0)))))) is different from false [2023-09-08 06:44:03,609 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse20 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* (select .cse20 .cse12) 4)) |c_t1Thread1of1ForFork0_enqueue_~x#1|)))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204)) (.cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse13 (+ 1 (select .cse10 .cse12)))) (and (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_619 Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse2 (let ((.cse3 (let ((.cse5 (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_619) .cse12 .cse13)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (store .cse5 |c_~#queue~0.base| (store (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0) (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)))))) (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_619 Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse15 (let ((.cse16 (let ((.cse17 (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_619) .cse12 .cse13)))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (store .cse17 |c_~#queue~0.base| (store (store (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (not (= (let ((.cse14 (select .cse15 |c_~#queue~0.base|))) (select .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse15 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1)))))))))) is different from false [2023-09-08 06:44:31,447 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse10 (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse20 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 (select .cse20 .cse12))) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|)))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204)) (.cse11 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse13 (+ (select .cse10 .cse12) 1))) (and (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_619 Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse2 (let ((.cse3 (let ((.cse5 (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse10 .cse11 v_ArrVal_619) .cse12 .cse13)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (store .cse5 |c_~#queue~0.base| (store (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0) (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0)))))) (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_619 Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse14 (let ((.cse16 (let ((.cse17 (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse10 .cse11 v_ArrVal_619) .cse12 .cse13)))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |c_t1Thread1of1ForFork0_~value~0#1|))))) (store .cse17 |c_~#queue~0.base| (store (store (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse14 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1))) (not (= (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (select .cse15 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|))) 0))))))))) is different from false [2023-09-08 06:44:33,799 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse12 (+ (* (select .cse11 .cse7) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_619 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse0 (let ((.cse3 (let ((.cse5 (let ((.cse9 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (store .cse11 .cse12 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse10 .cse8 v_ArrVal_619) .cse7 (+ (select .cse10 .cse7) 1)))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse5 |c_~#queue~0.base| (store (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse7) 4)) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1))) (not (= (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (select .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)))) 0))))) (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_619 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse18 (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse19 (store .cse11 .cse12 |t1Thread1of1ForFork0_~value~0#1|))) (store (store .cse19 .cse8 v_ArrVal_619) .cse7 (+ (select .cse19 .cse7) 1)))))) (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse16 |c_~#queue~0.base| (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse7) 4)) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (= (let ((.cse13 (select .cse14 |c_~#queue~0.base|))) (select .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse2) 4)))) 0) (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse14 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))))))))) is different from false [2023-09-08 06:44:34,979 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_619 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse2 (let ((.cse3 (let ((.cse5 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_616))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse11 .cse8 v_ArrVal_619) .cse7 (+ (select .cse11 .cse7) 1))))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse5 |c_~#queue~0.base| (store (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1)))))) (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_619 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse13 (let ((.cse15 (let ((.cse16 (let ((.cse18 (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_616))) (store .cse19 |c_~#queue~0.base| (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse7) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse20 .cse8 v_ArrVal_619) .cse7 (+ (select .cse20 .cse7) 1))))))) (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse16 |c_~#queue~0.base| (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse13 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))) (= (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (select .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|))) 0)))))) is different from false [2023-09-08 06:44:35,495 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_619 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse0 (let ((.cse3 (let ((.cse5 (let ((.cse9 (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_615) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_616))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse7) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse11 .cse8 v_ArrVal_619) .cse7 (+ (select .cse11 .cse7) 1))))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse5 |c_~#queue~0.base| (store (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* 4 (select .cse6 .cse7))) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 0))) (= (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (select .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|))) 0)))) (forall ((v_ArrVal_631 Int) (v_ArrVal_630 Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_619 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int)) (let ((.cse13 (let ((.cse15 (let ((.cse16 (let ((.cse18 (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_615) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_616))) (store .cse19 |c_~#queue~0.base| (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse7) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (store (store .cse20 .cse8 v_ArrVal_619) .cse7 (+ (select .cse20 .cse7) 1))))))) (store .cse18 |c_~#stored_elements~0.base| (store (select .cse18 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| |t1Thread1of1ForFork0_~value~0#1|))))) (store .cse16 |c_~#queue~0.base| (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* 4 (select .cse17 .cse7))) v_ArrVal_625)) .cse8 v_ArrVal_627) .cse7 v_ArrVal_630))))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) .cse4 v_ArrVal_631))))) (or (forall ((v_ArrVal_634 (Array Int Int))) (not (= (select (select (store .cse13 |c_~#queue~0.base| v_ArrVal_634) |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset|) 1))) (not (= (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (select .cse14 (+ (* 4 (select .cse14 .cse2)) |c_~#queue~0.offset|))) 0))))))) is different from false [2023-09-08 06:45:11,470 INFO L322 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2023-09-08 06:45:11,470 INFO L351 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 5 case distinctions, treesize of input 6678 treesize of output 3966 [2023-09-08 06:45:11,937 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 06:45:11,938 INFO L351 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 44961 treesize of output 43581 [2023-09-08 06:45:13,419 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 06:45:13,433 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 53853827478 treesize of output 43956167455 Received shutdown request... [2023-09-08 06:54:02,407 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-08 06:54:02,408 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-08 06:54:02,408 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-08 06:54:02,436 WARN L266 SmtUtils]: Removed 1 from assertion stack [2023-09-08 06:54:02,439 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-08 06:54:02,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-08 06:54:02,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 06:54:02,646 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-79-3-3-3-3-3-3-3-3-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-5-3-5-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. [2023-09-08 06:54:02,648 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-08 06:54:02,648 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-08 06:54:02,648 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-08 06:54:02,648 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-09-08 06:54:02,649 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-09-08 06:54:02,649 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-08 06:54:02,653 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-08 06:54:02,657 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-08 06:54:02,657 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-08 06:54:02,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 06:54:02 BasicIcfg [2023-09-08 06:54:02,659 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-08 06:54:02,660 INFO L158 Benchmark]: Toolchain (without parser) took 835127.73ms. Allocated memory was 221.2MB in the beginning and 1.0GB in the end (delta: 822.1MB). Free memory was 166.5MB in the beginning and 552.0MB in the end (delta: -385.5MB). Peak memory consumption was 651.8MB. Max. memory is 7.0GB. [2023-09-08 06:54:02,660 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 158.3MB. Free memory is still 113.3MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-08 06:54:02,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.53ms. Allocated memory is still 221.2MB. Free memory was 166.5MB in the beginning and 136.1MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 7.0GB. [2023-09-08 06:54:02,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.80ms. Allocated memory is still 221.2MB. Free memory was 136.1MB in the beginning and 133.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. [2023-09-08 06:54:02,667 INFO L158 Benchmark]: Boogie Preprocessor took 33.13ms. Allocated memory is still 221.2MB. Free memory was 133.0MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-08 06:54:02,667 INFO L158 Benchmark]: RCFGBuilder took 492.61ms. Allocated memory is still 221.2MB. Free memory was 130.3MB in the beginning and 107.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 7.0GB. [2023-09-08 06:54:02,667 INFO L158 Benchmark]: TraceAbstraction took 833961.52ms. Allocated memory was 221.2MB in the beginning and 1.0GB in the end (delta: 822.1MB). Free memory was 106.2MB in the beginning and 552.0MB in the end (delta: -445.8MB). Peak memory consumption was 592.0MB. Max. memory is 7.0GB. [2023-09-08 06:54:02,672 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 158.3MB. Free memory is still 113.3MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 570.53ms. Allocated memory is still 221.2MB. Free memory was 166.5MB in the beginning and 136.1MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 47.80ms. Allocated memory is still 221.2MB. Free memory was 136.1MB in the beginning and 133.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 33.13ms. Allocated memory is still 221.2MB. Free memory was 133.0MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 492.61ms. Allocated memory is still 221.2MB. Free memory was 130.3MB in the beginning and 107.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 7.0GB. * TraceAbstraction took 833961.52ms. Allocated memory was 221.2MB in the beginning and 1.0GB in the end (delta: 822.1MB). Free memory was 106.2MB in the beginning and 552.0MB in the end (delta: -445.8MB). Peak memory consumption was 592.0MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 750]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [750] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1701, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 147, dependent conditional: 147, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 10, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 630, independent: 628, independent conditional: 0, independent unconditional: 628, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 630, independent: 627, independent conditional: 0, independent unconditional: 627, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1566, independent: 926, independent conditional: 0, independent unconditional: 926, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 630, unknown conditional: 0, unknown unconditional: 630] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 3, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 55, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1701, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 147, dependent conditional: 147, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 10, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 630, independent: 628, independent conditional: 0, independent unconditional: 628, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 630, independent: 627, independent conditional: 0, independent unconditional: 627, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1566, independent: 926, independent conditional: 0, independent unconditional: 926, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 630, unknown conditional: 0, unknown unconditional: 630] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 8, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 75, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1701, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 147, dependent conditional: 147, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 10, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 630, independent: 628, independent conditional: 0, independent unconditional: 628, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 630, independent: 627, independent conditional: 0, independent unconditional: 627, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1566, independent: 926, independent conditional: 0, independent unconditional: 926, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 630, unknown conditional: 0, unknown unconditional: 630] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 15, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 79, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1701, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 147, dependent conditional: 147, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 10, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 630, independent: 628, independent conditional: 0, independent unconditional: 628, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 630, independent: 627, independent conditional: 0, independent unconditional: 627, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1566, independent: 926, independent conditional: 0, independent unconditional: 926, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 630, unknown conditional: 0, unknown unconditional: 630] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 22, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 78, independent: 71, independent conditional: 71, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1701, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 147, dependent conditional: 147, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 10, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 630, independent: 628, independent conditional: 0, independent unconditional: 628, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 630, independent: 627, independent conditional: 0, independent unconditional: 627, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1566, independent: 926, independent conditional: 0, independent unconditional: 926, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 630, unknown conditional: 0, unknown unconditional: 630] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 29, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 273, independent: 242, independent conditional: 242, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1701, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 147, dependent conditional: 147, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 10, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 630, independent: 628, independent conditional: 0, independent unconditional: 628, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 630, independent: 627, independent conditional: 0, independent unconditional: 627, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1566, independent: 926, independent conditional: 0, independent unconditional: 926, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 630, unknown conditional: 0, unknown unconditional: 630] , Statistics on independence cache: Total cache size (in pairs): 278, Positive cache size: 276, Positive conditional cache size: 0, Positive unconditional cache size: 276, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 5, Independence queries for same thread: 58, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 241, independent: 222, independent conditional: 222, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1701, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 147, dependent conditional: 147, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 10, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 630, independent: 628, independent conditional: 0, independent unconditional: 628, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 630, independent: 627, independent conditional: 0, independent unconditional: 627, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1566, independent: 926, independent conditional: 0, independent unconditional: 926, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 630, unknown conditional: 0, unknown unconditional: 630] , Statistics on independence cache: Total cache size (in pairs): 372, Positive cache size: 370, Positive conditional cache size: 0, Positive unconditional cache size: 370, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 5, Independence queries for same thread: 77, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 321, independent: 301, independent conditional: 301, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1701, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 147, dependent conditional: 147, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 10, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 630, independent: 628, independent conditional: 0, independent unconditional: 628, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 630, independent: 627, independent conditional: 0, independent unconditional: 627, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1566, independent: 926, independent conditional: 0, independent unconditional: 926, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 630, unknown conditional: 0, unknown unconditional: 630] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 436, Positive conditional cache size: 0, Positive unconditional cache size: 436, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 5, Independence queries for same thread: 97, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 376, independent: 351, independent conditional: 351, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1701, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 147, dependent conditional: 147, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 10, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 630, independent: 628, independent conditional: 0, independent unconditional: 628, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 630, independent: 627, independent conditional: 0, independent unconditional: 627, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1566, independent: 926, independent conditional: 0, independent unconditional: 926, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 630, unknown conditional: 0, unknown unconditional: 630] , Statistics on independence cache: Total cache size (in pairs): 586, Positive cache size: 584, Positive conditional cache size: 0, Positive unconditional cache size: 584, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 5, Independence queries for same thread: 122, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 200, independent: 177, independent conditional: 177, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1701, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 147, dependent conditional: 147, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1556, independent: 1554, independent conditional: 1554, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 10, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1566, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 630, independent: 628, independent conditional: 0, independent unconditional: 628, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 630, independent: 627, independent conditional: 0, independent unconditional: 627, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1566, independent: 926, independent conditional: 0, independent unconditional: 926, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 630, unknown conditional: 0, unknown unconditional: 630] , Statistics on independence cache: Total cache size (in pairs): 630, Positive cache size: 628, Positive conditional cache size: 0, Positive unconditional cache size: 628, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 5, Independence queries for same thread: 145, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-79-3-3-3-3-3-3-3-3-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-5-3-5-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-79-3-3-3-3-3-3-3-3-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-5-3-5-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1062]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-79-3-3-3-3-3-3-3-3-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-5-3-5-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-79-3-3-3-3-3-3-3-3-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-5-3-5-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 208 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-24-3-3-2-3-2-3-2-3-2-2-2-3-2-3-2-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-79-3-3-3-3-3-3-3-3-5-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-7-3-5-3-5-3-5-3-5-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 407 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 833.8s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 75.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 57.7s InterpolantComputationTime, 1732 NumberOfCodeBlocks, 1732 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1910 ConstructedInterpolants, 158 QuantifiedInterpolants, 95724 SizeOfPredicates, 73 NumberOfNonLiveVariables, 899 ConjunctsInSsa, 238 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 181/185 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown