/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longest.line295.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-09-30 06:22:12,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-30 06:22:12,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-30 06:22:12,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-30 06:22:12,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-30 06:22:12,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-30 06:22:12,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-30 06:22:12,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-30 06:22:12,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-30 06:22:12,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-30 06:22:12,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-30 06:22:12,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-30 06:22:12,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-30 06:22:12,433 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-30 06:22:12,434 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-30 06:22:12,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-30 06:22:12,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-30 06:22:12,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-30 06:22:12,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-30 06:22:12,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-30 06:22:12,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-30 06:22:12,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-30 06:22:12,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-30 06:22:12,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-30 06:22:12,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-30 06:22:12,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-30 06:22:12,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-30 06:22:12,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-30 06:22:12,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-30 06:22:12,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-30 06:22:12,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-30 06:22:12,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-30 06:22:12,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-30 06:22:12,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-30 06:22:12,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-30 06:22:12,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-30 06:22:12,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-30 06:22:12,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-30 06:22:12,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-30 06:22:12,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-30 06:22:12,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-30 06:22:12,458 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-09-30 06:22:12,481 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-30 06:22:12,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-30 06:22:12,482 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-30 06:22:12,482 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-30 06:22:12,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-30 06:22:12,482 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-30 06:22:12,483 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-30 06:22:12,483 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-30 06:22:12,483 INFO L138 SettingsManager]: * Use SBE=true [2022-09-30 06:22:12,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-30 06:22:12,484 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-30 06:22:12,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-30 06:22:12,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-30 06:22:12,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-30 06:22:12,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-30 06:22:12,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-30 06:22:12,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-30 06:22:12,484 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-30 06:22:12,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-30 06:22:12,484 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-30 06:22:12,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-30 06:22:12,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-30 06:22:12,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-30 06:22:12,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-30 06:22:12,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-30 06:22:12,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-30 06:22:12,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-30 06:22:12,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-30 06:22:12,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-30 06:22:12,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-30 06:22:12,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-30 06:22:12,485 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-30 06:22:12,486 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-09-30 06:22:12,486 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-30 06:22:12,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-30 06:22:12,486 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-09-30 06:22:12,486 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-09-30 06:22:12,486 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-09-30 06:22:12,486 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC 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 [2022-09-30 06:22:12,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-30 06:22:12,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-30 06:22:12,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-30 06:22:12,673 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-30 06:22:12,674 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-30 06:22:12,675 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longest.line295.bpl [2022-09-30 06:22:12,675 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longest.line295.bpl' [2022-09-30 06:22:12,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-30 06:22:12,729 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-09-30 06:22:12,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-30 06:22:12,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-30 06:22:12,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-30 06:22:12,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:22:12" (1/1) ... [2022-09-30 06:22:12,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:22:12" (1/1) ... [2022-09-30 06:22:12,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:22:12" (1/1) ... [2022-09-30 06:22:12,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:22:12" (1/1) ... [2022-09-30 06:22:12,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:22:12" (1/1) ... [2022-09-30 06:22:12,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:22:12" (1/1) ... [2022-09-30 06:22:12,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:22:12" (1/1) ... [2022-09-30 06:22:12,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-30 06:22:12,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-30 06:22:12,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-30 06:22:12,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-30 06:22:12,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:22:12" (1/1) ... [2022-09-30 06:22:12,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-30 06:22:12,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:22:12,814 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) [2022-09-30 06:22:12,821 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 [2022-09-30 06:22:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-09-30 06:22:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-09-30 06:22:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-09-30 06:22:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-09-30 06:22:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-30 06:22:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-30 06:22:12,849 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-30 06:22:12,949 INFO L234 CfgBuilder]: Building ICFG [2022-09-30 06:22:12,951 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-30 06:22:13,373 INFO L275 CfgBuilder]: Performing block encoding [2022-09-30 06:22:13,395 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-30 06:22:13,395 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-09-30 06:22:13,398 INFO L202 PluginConnector]: Adding new model queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 06:22:13 BoogieIcfgContainer [2022-09-30 06:22:13,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-30 06:22:13,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-30 06:22:13,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-30 06:22:13,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-30 06:22:13,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:22:12" (1/2) ... [2022-09-30 06:22:13,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fc53a1 and model type queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 06:22:13, skipping insertion in model container [2022-09-30 06:22:13,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 06:22:13" (2/2) ... [2022-09-30 06:22:13,409 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.line295.bpl [2022-09-30 06:22:13,414 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-30 06:22:13,421 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-30 06:22:13,421 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-30 06:22:13,421 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-30 06:22:13,540 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-30 06:22:13,574 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:22:13,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:22:13,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:22:13,576 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) [2022-09-30 06:22:13,577 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 [2022-09-30 06:22:13,601 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:22:13,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-09-30 06:22:13,611 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;@5e9702ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:22:13,611 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:22:13,661 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-09-30 06:22:13,664 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:22:13,665 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-09-30 06:22:13,672 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:22:13,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:22:13,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:22:13,674 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 06:22:13,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-09-30 06:22:13,678 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:22:13,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-09-30 06:22:13,679 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;@5e9702ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:22:13,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:22:13,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-09-30 06:22:14,000 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:22:14,003 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-09-30 06:22:14,014 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:22:14,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:22:14,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:22:14,176 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 06:22:14,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-09-30 06:22:14,180 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:22:14,181 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-09-30 06:22:14,181 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;@5e9702ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:22:14,182 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:22:14,182 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-09-30 06:22:14,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-30 06:22:14,182 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:22:14,183 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-09-30 06:22:14,186 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:22:14,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:22:14,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:22:14,188 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 06:22:14,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-09-30 06:22:14,194 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:22:14,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-09-30 06:22:14,195 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;@5e9702ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:22:14,195 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:22:14,251 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:22:14,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:22:14,256 INFO L85 PathProgramCache]: Analyzing trace with hash -944447742, now seen corresponding path program 1 times [2022-09-30 06:22:14,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:22:14,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875458567] [2022-09-30 06:22:14,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:22:14,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:22:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:22:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:22:14,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:22:14,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875458567] [2022-09-30 06:22:14,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875458567] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:22:14,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:22:14,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-30 06:22:14,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197335678] [2022-09-30 06:22:14,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:22:14,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-30 06:22:14,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:22:14,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-30 06:22:14,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-30 06:22:14,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:14,554 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:22:14,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.0) internal successors, (218), 2 states have internal predecessors, (218), 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) [2022-09-30 06:22:14,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:14,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:14,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-30 06:22:14,576 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:22:14,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:22:14,577 INFO L85 PathProgramCache]: Analyzing trace with hash -484467378, now seen corresponding path program 1 times [2022-09-30 06:22:14,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:22:14,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388052732] [2022-09-30 06:22:14,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:22:14,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:22:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:22:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:22:18,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:22:18,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388052732] [2022-09-30 06:22:18,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388052732] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:22:18,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:22:18,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-09-30 06:22:18,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616015466] [2022-09-30 06:22:18,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:22:18,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-09-30 06:22:18,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:22:18,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-09-30 06:22:18,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2022-09-30 06:22:18,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:18,777 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:22:18,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 6.545454545454546) internal successors, (216), 34 states have internal predecessors, (216), 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) [2022-09-30 06:22:18,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:18,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:34,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-30 06:22:34,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-30 06:22:34,562 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:22:34,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:22:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash 981294747, now seen corresponding path program 1 times [2022-09-30 06:22:34,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:22:34,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485102072] [2022-09-30 06:22:34,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:22:34,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:22:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:22:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:22:35,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:22:35,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485102072] [2022-09-30 06:22:35,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485102072] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:22:35,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203136458] [2022-09-30 06:22:35,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:22:35,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:22:35,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:22:35,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 06:22:35,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-09-30 06:22:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:22:35,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 95 conjunts are in the unsatisfiable core [2022-09-30 06:22:35,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:22:35,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-30 06:22:35,669 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-30 06:22:35,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-09-30 06:22:36,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-30 06:22:36,248 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 06:22:36,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 18 [2022-09-30 06:22:36,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:22:36,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 [2022-09-30 06:22:36,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-30 06:22:37,153 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-30 06:22:37,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-09-30 06:22:37,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:22:37,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 [2022-09-30 06:22:37,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 06:22:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:22:37,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-30 06:22:37,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203136458] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:22:37,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-30 06:22:37,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [23] total 57 [2022-09-30 06:22:37,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705244204] [2022-09-30 06:22:37,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:22:37,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-09-30 06:22:37,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:22:37,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-09-30 06:22:37,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3001, Unknown=0, NotChecked=0, Total=3192 [2022-09-30 06:22:37,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:37,454 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:22:37,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.485714285714286) internal successors, (297), 35 states have internal predecessors, (297), 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) [2022-09-30 06:22:37,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:37,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-09-30 06:22:37,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-30 06:22:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-30 06:22:41,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-09-30 06:22:41,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:22:41,300 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:22:41,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:22:41,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1444466288, now seen corresponding path program 1 times [2022-09-30 06:22:41,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:22:41,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175476609] [2022-09-30 06:22:41,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:22:41,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:22:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:22:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:22:42,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:22:42,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175476609] [2022-09-30 06:22:42,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175476609] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:22:42,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385333684] [2022-09-30 06:22:42,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:22:42,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:22:42,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:22:42,673 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 06:22:42,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-09-30 06:22:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:22:42,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 125 conjunts are in the unsatisfiable core [2022-09-30 06:22:42,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:22:42,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-30 06:22:43,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-30 06:22:43,185 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 06:22:43,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 06:22:43,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-09-30 06:22:43,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-30 06:22:43,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:22:43,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 [2022-09-30 06:22:44,184 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-30 06:22:44,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-09-30 06:22:44,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-09-30 06:22:45,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:22:45,288 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-30 06:22:45,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-09-30 06:22:45,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:22:45,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 [2022-09-30 06:22:46,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:22:46,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-30 06:22:46,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-30 06:22:46,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:22:46,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-30 06:22:47,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-30 06:22:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:22:47,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:22:47,855 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_166 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_166 (Array Int Int))) (< (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)))) is different from false [2022-09-30 06:22:47,876 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (forall ((v_ArrVal_166 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_166 (Array Int Int))) (< (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-09-30 06:22:47,896 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_166 (Array Int Int))) (< (+ 3 |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_166 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4))))))) is different from false [2022-09-30 06:22:47,968 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:22:47,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-09-30 06:22:47,975 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:22:47,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 45 [2022-09-30 06:22:47,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-30 06:22:47,995 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:22:47,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-09-30 06:22:47,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:22:47,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2022-09-30 06:22:49,429 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 4))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (< (+ 7 |c_~#queue~0.offset| (* (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4)) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|))))) is different from false [2022-09-30 06:22:50,111 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (< (+ 7 (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (<= 0 (+ (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset| 4))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|))))) is different from false [2022-09-30 06:22:57,989 WARN L233 SmtUtils]: Spent 7.71s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:23:04,601 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:23:14,929 WARN L233 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:23:31,141 WARN L233 SmtUtils]: Spent 14.09s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:23:44,801 WARN L233 SmtUtils]: Spent 10.81s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:24:00,168 WARN L233 SmtUtils]: Spent 11.94s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:24:16,986 WARN L233 SmtUtils]: Spent 12.51s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:24:45,702 WARN L233 SmtUtils]: Spent 18.28s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:25:02,644 WARN L233 SmtUtils]: Spent 16.76s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:25:13,351 WARN L233 SmtUtils]: Spent 10.52s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:25:24,030 WARN L233 SmtUtils]: Spent 10.07s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:25:32,438 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:25:47,548 WARN L233 SmtUtils]: Spent 12.92s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:26:02,699 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-09-30 06:26:02,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 68 [2022-09-30 06:26:02,708 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:26:02,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 105 [2022-09-30 06:26:02,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:26:02,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-09-30 06:26:02,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-09-30 06:26:02,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:26:02,767 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:26:02,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 81 [2022-09-30 06:26:02,922 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-09-30 06:26:02,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 56 [2022-09-30 06:26:02,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:26:02,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-09-30 06:26:02,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:26:02,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2022-09-30 06:26:17,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 114 treesize of output 110 [2022-09-30 06:26:17,321 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:26:17,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 58 [2022-09-30 06:26:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:26:17,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385333684] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 06:26:17,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 06:26:17,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 46, 48] total 134 [2022-09-30 06:26:17,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174649147] [2022-09-30 06:26:17,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 06:26:17,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 135 states [2022-09-30 06:26:17,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:26:17,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2022-09-30 06:26:17,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=16119, Unknown=51, NotChecked=1300, Total=18090 [2022-09-30 06:26:17,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:26:17,577 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:26:17,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 135 states, 134 states have (on average 5.895522388059701) internal successors, (790), 135 states have internal predecessors, (790), 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) [2022-09-30 06:26:17,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:26:17,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-09-30 06:26:17,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-30 06:26:17,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:26:22,876 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (let ((.cse0 (+ |c_ULTIMATE.start_init_~q#1.offset| 3204)) (.cse7 (select |c_#length| |c_~#queue~0.base|)) (.cse1 (= (select .cse9 3204) 0)) (.cse4 (< |c_~#stored_elements~0.base| |c_~#queue~0.base|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) .cse0) 0) (not (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 0) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |c_ULTIMATE.start_read~int_#ptr#1.base| |c_~#queue~0.base|) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (<= 0 |c_~#queue~0.offset|) .cse1 (or (and (forall ((v_ArrVal_157 Int) (v_ArrVal_162 Int) (v_ArrVal_160 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41| Int) (v_ArrVal_159 (Array Int Int))) (let ((.cse2 (select (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_157)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_159) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ 7 (* 4 (select (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41| v_ArrVal_160) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) .cse3)) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)) (< (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41|) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|))))) .cse4 (forall ((v_ArrVal_157 Int) (v_ArrVal_162 Int) (v_ArrVal_160 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41| Int) (v_ArrVal_159 (Array Int Int))) (let ((.cse5 (select (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_157)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_159) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (* (select .cse5 .cse6) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41|) (not (<= (+ 3208 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (<= 0 (+ (* 4 (select (store (store .cse5 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41| v_ArrVal_160) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) .cse6)) |c_~#queue~0.offset| 4)))))) (< .cse7 (+ 3212 |c_~#queue~0.offset|))) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= 0 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|) .cse0)) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= 3204 |c_ULTIMATE.start_read~int_#ptr#1.offset|) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (<= 3212 .cse7) (let ((.cse8 (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|))) (or (and .cse1 (not .cse8)) (and .cse8 (not (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 3204)) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) 3204) 0)))) (or (and (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= 0 (+ |c_~#queue~0.offset| 4)) .cse4) (forall ((v_ArrVal_154 Int) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int)) (or (< (select (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_154) |c_~#queue~0.base|) (+ 3212 |c_~#queue~0.offset|)) (not (= 0 (select |c_#valid| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|) 3204) 0) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|) 3204) 0) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (= |c_ULTIMATE.start_read~int_#ptr#1.base| |c_ULTIMATE.start_empty_~q#1.base|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (<= (select |c_#length| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 4) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (= (select .cse9 (+ |c_~#queue~0.offset| 3204)) 0) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4)))) is different from false [2022-09-30 06:26:26,703 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse5 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse0 (<= .cse5 4)) (.cse1 (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse9) 0)) (.cse3 (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse9) 0)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4))) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (<= (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (or .cse0 (and .cse1 .cse2)) (or (and .cse3 .cse2) .cse0) (= |c_t1Thread1of1ForFork1_read~int_#value#1| 0) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) .cse1 (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (< (+ 7 (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (<= 0 |c_~#queue~0.offset|) (<= 0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= (select .cse4 3204) |c_t1Thread1of1ForFork1_read~int_#value#1|) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= |c_~#queue~0.offset| 0) .cse3 (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 3212 .cse5) (<= (+ |c_t1Thread1of1ForFork1_write~int_#sizeOfWrittenType#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|)) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| (select .cse4 .cse6)) (let ((.cse8 (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|))) (or (and (= (select .cse7 3204) 0) (not .cse8)) (and .cse8 (not (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 3204)) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) 3204) 0)))) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 3204) 0) (= 7 |c_~#queue~0.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse2 (forall ((v_ArrVal_162 Int)) (<= 0 (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_162)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset| 4))) (<= 4 |c_t1Thread1of1ForFork1_read~int_#sizeOfReadType#1|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| (+ (* (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse6) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((v_ArrVal_162 Int)) (< (+ 7 (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_162)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (<= 0 (+ (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset| 4))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (<= |c_~#stored_elements~0.base| 6) (= (select .cse7 .cse9) 0)))) is different from false [2022-09-30 06:26:27,422 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (< (+ 7 (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 3204) 0) (= 7 |c_~#queue~0.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (<= 0 (+ (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) |c_~#queue~0.offset| 4))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-30 06:26:28,148 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4) 4))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (= 7 |c_~#queue~0.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (< (+ 7 |c_~#queue~0.offset| (* (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 4)) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 3204) 0) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-09-30 06:26:28,890 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse0 (select .cse2 3204))) (and (<= (+ 3208 (* .cse0 4)) .cse1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (<= (+ 3212 |c_~#queue~0.offset|) .cse1) (<= 1 .cse0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_166 (Array Int Int))) (< (+ 3 |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)) (select |c_#length| |c_~#queue~0.base|))))) (= 7 |c_~#queue~0.base|) (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4)) (= (select .cse2 (+ |c_~#queue~0.offset| 3204)) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_166 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)))))) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-09-30 06:26:28,896 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (let ((.cse1 (select .cse0 3204)) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_~#queue~0.offset| 3204)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (+ 3208 (* .cse1 4)) .cse2) (<= 0 |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (forall ((v_ArrVal_166 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)))) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_166 (Array Int Int))) (< (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))))) (<= 1 .cse1) (<= (+ 3212 |c_~#queue~0.offset|) .cse2) (= 7 |c_~#queue~0.base|) (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4)) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-09-30 06:26:29,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:26:29,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-30 06:26:29,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-30 06:26:29,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-09-30 06:26:29,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-09-30 06:26:29,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:26:29,883 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:26:29,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:26:29,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1770284473, now seen corresponding path program 1 times [2022-09-30 06:26:29,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:26:29,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930827650] [2022-09-30 06:26:29,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:26:29,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:26:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:26:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 58 proven. 52 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-09-30 06:26:30,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:26:30,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930827650] [2022-09-30 06:26:30,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930827650] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:26:30,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060886612] [2022-09-30 06:26:30,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:26:30,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:26:30,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:26:30,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 06:26:30,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-09-30 06:26:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:26:30,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 164 conjunts are in the unsatisfiable core [2022-09-30 06:26:30,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:26:30,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-30 06:26:30,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-30 06:26:30,928 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 06:26:30,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-30 06:26:30,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-09-30 06:26:31,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-30 06:26:31,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:26:31,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 [2022-09-30 06:26:32,044 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-30 06:26:32,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-09-30 06:26:32,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-09-30 06:26:33,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:26:33,065 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-30 06:26:33,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-09-30 06:26:33,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:26:33,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 32 [2022-09-30 06:26:33,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:26:33,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-09-30 06:26:34,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-30 06:26:34,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:26:34,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 30 [2022-09-30 06:26:35,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:26:35,198 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-30 06:26:35,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-09-30 06:26:35,393 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 06:26:35,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 27 [2022-09-30 06:26:35,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:26:35,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 [2022-09-30 06:26:35,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:26:35,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-30 06:26:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 60 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:26:35,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:26:55,546 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:26:55,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 42 [2022-09-30 06:26:55,553 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:26:55,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 81 [2022-09-30 06:26:55,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 74 [2022-09-30 06:26:55,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-09-30 06:26:55,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:26:55,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 54 [2022-09-30 06:27:12,424 WARN L233 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:28:01,800 WARN L233 SmtUtils]: Spent 9.31s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:28:10,840 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-09-30 06:28:10,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 40 [2022-09-30 06:28:10,849 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:28:10,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 50 [2022-09-30 06:28:10,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-09-30 06:28:10,903 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-09-30 06:28:10,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 31 [2022-09-30 06:28:10,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:28:10,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2022-09-30 06:28:11,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 50 [2022-09-30 06:28:12,010 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:28:12,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 58 [2022-09-30 06:28:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 60 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:28:12,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060886612] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 06:28:12,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 06:28:12,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 54, 53] total 124 [2022-09-30 06:28:12,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776865163] [2022-09-30 06:28:12,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 06:28:12,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 124 states [2022-09-30 06:28:12,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:28:12,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2022-09-30 06:28:12,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=14495, Unknown=113, NotChecked=0, Total=15252 [2022-09-30 06:28:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:28:12,276 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:28:12,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 124 states, 124 states have (on average 7.911290322580645) internal successors, (981), 124 states have internal predecessors, (981), 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) [2022-09-30 06:28:12,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:28:12,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-09-30 06:28:12,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-30 06:28:12,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-09-30 06:28:12,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:28:16,549 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (< |c_~#stored_elements~0.base| |c_~#queue~0.base|))) (let ((.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse0 (+ |c_~#queue~0.offset| 3204)) (.cse2 (and (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) .cse3))) (and (= |c_ULTIMATE.start_init_~q#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= 0 (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 3204))) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (<= 3212 .cse1) (<= (+ 3208 |c_~#queue~0.offset|) |c_ULTIMATE.start_write~int_#ptr#1.offset|) (or .cse2 (forall ((v_ArrVal_237 Int)) (< (select (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_237) |c_~#queue~0.base|) (+ 3212 |c_~#queue~0.offset|)))) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (<= (+ 3212 (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (+ .cse1 |c_ULTIMATE.start_write~int_#sizeOfWrittenType#1| |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (or (< .cse1 (+ 3212 |c_~#queue~0.offset|)) (and (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_21| Int)) (or (not (<= (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) |v_ULTIMATE.start_write~int_#ptr#1.offset_21|)) (forall ((v_ArrVal_240 Int) (v_ArrVal_242 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_21| v_ArrVal_240)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_242) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799))))) .cse3 (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_21| Int)) (or (forall ((v_ArrVal_240 Int) (v_ArrVal_242 (Array Int Int))) (< (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_21| v_ArrVal_240)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_242) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) 3200)) (not (<= (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) |v_ULTIMATE.start_write~int_#ptr#1.offset_21|)))))) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse0) 0) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4) (or .cse2 (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_237 Int)) (or (< (select (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_237) |c_~#queue~0.base|) (+ 3212 |c_~#queue~0.offset|)) (not (= 0 (select |c_#valid| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|))))))))) is different from false [2022-09-30 06:28:20,016 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (< |c_~#stored_elements~0.base| |c_~#queue~0.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse6 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse3 (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4))) (.cse1 (<= .cse6 4)) (.cse2 (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse4) 0)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse7)) (.cse8 (and (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) .cse5))) (and (not (= .cse0 800)) (or .cse1 (and .cse2 .cse3)) (or (and (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse4) 0) .cse3) .cse1) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse0) .cse2 (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46| Int) (v_ArrVal_253 Int)) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46|)) (not (= 800 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46| v_ArrVal_253) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))))) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (or (and (forall ((v_ArrVal_240 Int) (v_ArrVal_242 (Array Int Int))) (< (* (select (select (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_240)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_242) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) 3200)) (forall ((v_ArrVal_240 Int) (v_ArrVal_242 (Array Int Int))) (not (= (select (select (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_240)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_242) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 799))) .cse5) (< .cse6 (+ 3212 |c_~#queue~0.offset|))) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (<= 3212 .cse6) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse7)) (= .cse7 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (or .cse8 (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_237 Int)) (or (< (select (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_237) |c_~#queue~0.base|) (+ 3212 |c_~#queue~0.offset|)) (not (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 0))))) (or .cse8 (forall ((v_ArrVal_237 Int)) (< (select (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_237) |c_~#queue~0.base|) (+ 3212 |c_~#queue~0.offset|)))) (not (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (not (= |c_t1Thread1of1ForFork1_read~int_#value#1| 800)) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse4) 0) (or .cse8 (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_237 Int)) (or (< (select (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_237) |c_~#queue~0.base|) (+ 3212 |c_~#queue~0.offset|)) (not (= 0 (select |c_#valid| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|))))))))) is different from false [2022-09-30 06:28:21,076 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_~#queue~0.base|))) (and (or (and (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 0) (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4))) (<= .cse0 4)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46| Int) (v_ArrVal_253 Int)) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46|)) (not (= 800 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46| v_ArrVal_253) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))))) (= |c_~#queue~0.offset| 0) (<= 3212 .cse0) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-30 06:28:25,447 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 3212 (select |c_#length| |c_~#queue~0.base|)) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) 3204) 1) (= (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (<= 3212 .cse0) (= 7 |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 3204) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) 3204) 1) (= (select (select |c_#memory_int| 7) .cse1) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) (or (< .cse0 (+ 3212 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_47| Int) (v_ArrVal_251 Int)) (or (not (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_47| v_ArrVal_251) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_47| (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))))) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| 7) .cse1) 1))) is different from false [2022-09-30 06:28:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:28:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-30 06:28:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-30 06:28:25,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-09-30 06:28:25,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-09-30 06:28:25,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-09-30 06:28:25,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:28:25,907 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:28:25,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:28:25,907 INFO L85 PathProgramCache]: Analyzing trace with hash 252233874, now seen corresponding path program 2 times [2022-09-30 06:28:25,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:28:25,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263345160] [2022-09-30 06:28:25,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:28:25,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:28:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:28:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:28:29,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:28:29,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263345160] [2022-09-30 06:28:29,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263345160] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:28:29,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177339215] [2022-09-30 06:28:29,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-30 06:28:29,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:28:29,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:28:29,098 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 06:28:29,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-09-30 06:28:29,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-30 06:28:29,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-30 06:28:29,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 230 conjunts are in the unsatisfiable core [2022-09-30 06:28:29,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:28:29,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 6 [2022-09-30 06:28:29,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-30 06:28:29,997 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-30 06:28:30,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-09-30 06:28:30,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2022-09-30 06:28:32,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-09-30 06:28:33,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-09-30 06:28:44,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:28:44,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 34 [2022-09-30 06:28:50,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2022-09-30 06:29:18,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-09-30 06:30:11,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-09-30 06:30:12,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 30 [2022-09-30 06:30:17,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:30:17,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 39 [2022-09-30 06:30:28,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:30:28,487 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-30 06:30:28,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 48 [2022-09-30 06:30:29,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:30:29,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2022-09-30 06:30:34,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:30:34,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2022-09-30 06:30:35,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 30 [2022-09-30 06:30:39,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:30:39,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 39 [2022-09-30 06:30:40,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 28 [2022-09-30 06:30:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 132 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:30:41,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:30:41,927 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_346 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_346) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)))) (forall ((v_ArrVal_346 (Array Int Int))) (< (+ 3 |c_~#queue~0.offset| (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_346) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)) (select |c_#length| |c_~#queue~0.base|)))) is different from false [2022-09-30 06:30:41,946 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_346 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_346) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)))))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_346 (Array Int Int))) (< (+ 3 |c_~#queue~0.offset| (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_346) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-09-30 06:30:41,967 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| Int)) (or (forall ((v_ArrVal_346 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_346) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204))) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| |c_~#stored_elements~0.base|)))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_346 (Array Int Int))) (< (+ (* 4 (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_346) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204))) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-09-30 06:30:42,043 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:30:42,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-09-30 06:30:42,050 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:30:42,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 51 [2022-09-30 06:30:42,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 14 [2022-09-30 06:30:42,077 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:30:42,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-09-30 06:30:42,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:30:42,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2022-09-30 06:31:09,624 WARN L233 SmtUtils]: Spent 23.38s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:31:28,498 WARN L233 SmtUtils]: Spent 18.59s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:31:38,998 WARN L233 SmtUtils]: Spent 10.25s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:31:39,794 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_339 (Array Int Int)) (v_ArrVal_343 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (let ((.cse1 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse0)) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)) (= 800 (select (store .cse1 .cse0 v_ArrVal_343) .cse2)))))) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_339 (Array Int Int))) (or (not (<= 0 (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_343 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* 4 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_343)) .cse4)))))))))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (forall ((v_ArrVal_339 (Array Int Int))) (or (not (<= 0 (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_343 Int)) (let ((.cse5 (let ((.cse7 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse6 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_343)) .cse7)))) (or (< (+ 7 |c_~#queue~0.offset| (* 4 .cse5)) (select |c_#length| |c_~#queue~0.base|)) (= 800 .cse5)))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|))))) is different from false [2022-09-30 06:31:39,858 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (forall ((v_ArrVal_339 (Array Int Int))) (or (forall ((v_ArrVal_343 Int)) (let ((.cse0 (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_343)) .cse2)))) (or (< (+ 7 |c_~#queue~0.offset| (* 4 .cse0)) (select |c_#length| |c_~#queue~0.base|)) (= 800 .cse0)))) (not (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_339 (Array Int Int))) (or (forall ((v_ArrVal_343 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (let ((.cse4 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse3 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_343)) .cse4))) 4))) (not (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 4)))))))) (or (forall ((v_ArrVal_339 (Array Int Int)) (v_ArrVal_343 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (let ((.cse5 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_339) |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (+ |c_~#queue~0.offset| (* (select .cse5 .cse7) 4)))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)) (= 800 (select (store .cse5 .cse6 v_ArrVal_343) .cse7)) (not (<= 0 .cse6)))))) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 06:31:40,094 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:31:40,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 59 [2022-09-30 06:31:40,102 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:31:40,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 104 [2022-09-30 06:31:40,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 65 [2022-09-30 06:31:40,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-09-30 06:31:40,195 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:31:40,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 129 treesize of output 105 [2022-09-30 06:31:40,236 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:31:40,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 89 [2022-09-30 06:31:40,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:31:40,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 153 [2022-09-30 06:31:40,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 121 treesize of output 93 [2022-09-30 06:31:40,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-09-30 06:31:40,551 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:31:40,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 473 treesize of output 345 [2022-09-30 06:31:43,918 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62| Int) (v_ArrVal_336 Int)) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62|)) (= (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62| v_ArrVal_336) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 800))))) (and (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse0) (or (< |c_~#stored_elements~0.base| |c_~#queue~0.base|) .cse0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62| Int)) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62|)) (forall ((v_ArrVal_336 Int)) (let ((.cse1 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62| v_ArrVal_336) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (let ((.cse2 (* .cse1 4))) (or (= .cse1 800) (= .cse1 799) (< (+ .cse2 |c_~#queue~0.offset| 11) (select |c_#length| |c_~#queue~0.base|)) (< (+ .cse2 |c_~#queue~0.offset| 4) 0))))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0))) is different from false [2022-09-30 06:31:44,841 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62| Int) (v_ArrVal_336 Int)) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62|)) (= 800 (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62| v_ArrVal_336) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))))) (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62| Int)) (or (not (<= (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62|)) (forall ((v_ArrVal_336 Int)) (let ((.cse0 (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_62| v_ArrVal_336) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (let ((.cse1 (* .cse0 4))) (or (= .cse0 799) (= 800 .cse0) (< (+ .cse1 |c_~#queue~0.offset| 4) 0) (< (+ .cse1 |c_~#queue~0.offset| 11) (select |c_#length| |c_~#queue~0.base|)))))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2) (or .cse2 (< |c_~#stored_elements~0.base| |c_~#queue~0.base|)) (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse2))) is different from false [2022-09-30 06:32:03,707 WARN L233 SmtUtils]: Spent 18.41s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:32:19,707 WARN L233 SmtUtils]: Spent 15.72s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:32:38,227 WARN L233 SmtUtils]: Spent 15.99s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:33:06,857 WARN L233 SmtUtils]: Spent 25.15s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:33:34,192 WARN L233 SmtUtils]: Spent 23.46s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:33:59,853 WARN L233 SmtUtils]: Spent 20.44s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:34:35,459 WARN L233 SmtUtils]: Spent 29.15s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:35:14,167 WARN L233 SmtUtils]: Spent 25.19s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:35:38,232 WARN L233 SmtUtils]: Spent 23.65s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:35:46,464 WARN L233 SmtUtils]: Spent 7.88s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:36:16,402 WARN L233 SmtUtils]: Spent 10.10s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:36:22,406 WARN L233 SmtUtils]: Spent 5.65s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:36:30,595 WARN L233 SmtUtils]: Spent 7.87s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-09-30 06:36:36,897 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:36:36,941 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:36:36,942 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 [2022-09-30 06:36:36,942 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:36:36,942 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 [2022-09-30 06:36:36,942 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:36:37,045 WARN L249 SmtUtils]: Removed 9 from assertion stack [2022-09-30 06:36:37,046 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-30 06:36:37,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-09-30 06:36:37,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-09-30 06:36:37,247 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 401 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 56 for 6059ms.. [2022-09-30 06:36:37,248 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-09-30 06:36:37,248 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was TIMEOUT (4/4) [2022-09-30 06:36:37,251 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-30 06:36:37,251 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-30 06:36:37,254 INFO L202 PluginConnector]: Adding new model queue_ok_longest.line295.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 06:36:37 BasicIcfg [2022-09-30 06:36:37,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-30 06:36:37,254 INFO L158 Benchmark]: Toolchain (without parser) took 864525.03ms. Allocated memory was 197.1MB in the beginning and 381.7MB in the end (delta: 184.5MB). Free memory was 155.4MB in the beginning and 215.8MB in the end (delta: -60.5MB). Peak memory consumption was 123.9MB. Max. memory is 8.0GB. [2022-09-30 06:36:37,254 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 197.1MB. Free memory was 159.0MB in the beginning and 158.8MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-30 06:36:37,254 INFO L158 Benchmark]: Boogie Preprocessor took 62.82ms. Allocated memory is still 197.1MB. Free memory was 155.4MB in the beginning and 151.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-09-30 06:36:37,255 INFO L158 Benchmark]: RCFGBuilder took 604.27ms. Allocated memory is still 197.1MB. Free memory was 151.9MB in the beginning and 159.7MB in the end (delta: -7.8MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. [2022-09-30 06:36:37,256 INFO L158 Benchmark]: TraceAbstraction took 863854.42ms. Allocated memory was 197.1MB in the beginning and 381.7MB in the end (delta: 184.5MB). Free memory was 159.2MB in the beginning and 215.8MB in the end (delta: -56.6MB). Peak memory consumption was 127.9MB. Max. memory is 8.0GB. [2022-09-30 06:36:37,264 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.10ms. Allocated memory is still 197.1MB. Free memory was 159.0MB in the beginning and 158.8MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 62.82ms. Allocated memory is still 197.1MB. Free memory was 155.4MB in the beginning and 151.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 604.27ms. Allocated memory is still 197.1MB. Free memory was 151.9MB in the beginning and 159.7MB in the end (delta: -7.8MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. * TraceAbstraction took 863854.42ms. Allocated memory was 197.1MB in the beginning and 381.7MB in the end (delta: 184.5MB). Free memory was 159.2MB in the beginning and 215.8MB in the end (delta: -56.6MB). Peak memory consumption was 127.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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, Independence queries for same thread: 2, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1768, positive: 1674, positive conditional: 1674, positive unconditional: 0, negative: 94, negative conditional: 94, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1768, positive: 1674, positive conditional: 1674, positive unconditional: 0, negative: 94, negative conditional: 94, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1688, positive: 1674, positive conditional: 0, positive unconditional: 1674, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1651, positive: 1637, positive conditional: 0, positive unconditional: 1637, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1688, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1651, unknown conditional: 0, unknown unconditional: 1651] , Statistics on independence cache: Total cache size (in pairs): 1651, Positive cache size: 1637, Positive conditional cache size: 0, Positive unconditional cache size: 1637, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Independence queries for same thread: 80, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 44, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 808, positive: 776, positive conditional: 776, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 776, positive: 776, positive conditional: 0, positive unconditional: 776, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 167, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 776, positive: 609, positive conditional: 0, positive unconditional: 609, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 167, unknown conditional: 0, unknown unconditional: 167] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 5, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 42, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 808, positive: 776, positive conditional: 776, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 776, positive: 776, positive conditional: 0, positive unconditional: 776, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 167, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 776, positive: 609, positive conditional: 0, positive unconditional: 609, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 167, unknown conditional: 0, unknown unconditional: 167] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 8, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 127, positive: 122, positive conditional: 122, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 808, positive: 776, positive conditional: 776, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 776, positive: 776, positive conditional: 0, positive unconditional: 776, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 167, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 776, positive: 609, positive conditional: 0, positive unconditional: 609, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 167, unknown conditional: 0, unknown unconditional: 167] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 13, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 138, positive: 133, positive conditional: 133, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 808, positive: 776, positive conditional: 776, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 776, positive: 776, positive conditional: 0, positive unconditional: 776, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 167, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 776, positive: 609, positive conditional: 0, positive unconditional: 609, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 167, unknown conditional: 0, unknown unconditional: 167] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 142, Positive conditional cache size: 0, Positive unconditional cache size: 142, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 18, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 223, positive: 216, positive conditional: 216, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 808, positive: 776, positive conditional: 776, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 776, positive: 776, positive conditional: 0, positive unconditional: 776, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 167, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 776, positive: 609, positive conditional: 0, positive unconditional: 609, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 167, unknown conditional: 0, unknown unconditional: 167] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 167, Positive conditional cache size: 0, Positive unconditional cache size: 167, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 25, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 234, positive: 227, positive conditional: 227, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 808, positive: 776, positive conditional: 776, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 776, positive: 776, positive conditional: 0, positive unconditional: 776, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 167, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 776, positive: 609, positive conditional: 0, positive unconditional: 609, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 167, unknown conditional: 0, unknown unconditional: 167] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 167, Positive conditional cache size: 0, Positive unconditional cache size: 167, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 32, Statistics for Abstraction: - TimeoutResultAtElement [Line: 295]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 401 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 56 for 6059ms.. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.3s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err0ASSERT_VIOLATIONASSERT with 2 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 863.1s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 45.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: 231, 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, 325.1s InterpolantComputationTime, 2422 NumberOfCodeBlocks, 2422 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 3109 ConstructedInterpolants, 558 QuantifiedInterpolants, 77528 SizeOfPredicates, 257 NumberOfNonLiveVariables, 2192 ConjunctsInSsa, 384 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 206/458 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