/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_longer.line295.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-04 00:52:56,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-04 00:52:56,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-04 00:52:56,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-04 00:52:56,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-04 00:52:56,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-04 00:52:56,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-04 00:52:56,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-04 00:52:56,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-04 00:52:56,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-04 00:52:56,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-04 00:52:56,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-04 00:52:56,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-04 00:52:56,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-04 00:52:56,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-04 00:52:56,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-04 00:52:56,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-04 00:52:56,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-04 00:52:56,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-04 00:52:56,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-04 00:52:56,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-04 00:52:56,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-04 00:52:56,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-04 00:52:56,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-04 00:52:56,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-04 00:52:56,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-04 00:52:56,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-04 00:52:56,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-04 00:52:56,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-04 00:52:56,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-04 00:52:56,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-04 00:52:56,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-04 00:52:56,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-04 00:52:56,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-04 00:52:56,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-04 00:52:56,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-04 00:52:56,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-04 00:52:56,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-04 00:52:56,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-04 00:52:56,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-04 00:52:56,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-04 00:52:56,958 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-04 00:52:57,002 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-04 00:52:57,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-04 00:52:57,002 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-04 00:52:57,002 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-04 00:52:57,003 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-04 00:52:57,003 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-04 00:52:57,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-04 00:52:57,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-04 00:52:57,004 INFO L138 SettingsManager]: * Use SBE=true [2022-10-04 00:52:57,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-04 00:52:57,004 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-04 00:52:57,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-04 00:52:57,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-04 00:52:57,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-04 00:52:57,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-04 00:52:57,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-04 00:52:57,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-04 00:52:57,005 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-04 00:52:57,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-04 00:52:57,005 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-04 00:52:57,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-04 00:52:57,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-04 00:52:57,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-04 00:52:57,006 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-04 00:52:57,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-04 00:52:57,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:52:57,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-04 00:52:57,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-04 00:52:57,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-04 00:52:57,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-04 00:52:57,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-04 00:52:57,007 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-04 00:52:57,010 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-04 00:52:57,010 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-04 00:52:57,010 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-04 00:52:57,010 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-04 00:52:57,011 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-04 00:52:57,011 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-04 00:52:57,011 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-10-04 00:52:57,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-04 00:52:57,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-04 00:52:57,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-04 00:52:57,273 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-04 00:52:57,274 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-04 00:52:57,275 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_longer.line295.bpl [2022-10-04 00:52:57,276 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longer.line295.bpl' [2022-10-04 00:52:57,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-04 00:52:57,335 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-04 00:52:57,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-04 00:52:57,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-04 00:52:57,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-04 00:52:57,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:57" (1/1) ... [2022-10-04 00:52:57,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:57" (1/1) ... [2022-10-04 00:52:57,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:57" (1/1) ... [2022-10-04 00:52:57,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:57" (1/1) ... [2022-10-04 00:52:57,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:57" (1/1) ... [2022-10-04 00:52:57,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:57" (1/1) ... [2022-10-04 00:52:57,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:57" (1/1) ... [2022-10-04 00:52:57,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-04 00:52:57,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-04 00:52:57,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-04 00:52:57,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-04 00:52:57,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:57" (1/1) ... [2022-10-04 00:52:57,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:52:57,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:52:57,481 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-10-04 00:52:57,496 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-10-04 00:52:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-10-04 00:52:57,525 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-10-04 00:52:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-10-04 00:52:57,525 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-10-04 00:52:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-04 00:52:57,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-04 00:52:57,527 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-04 00:52:57,727 INFO L234 CfgBuilder]: Building ICFG [2022-10-04 00:52:57,728 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-04 00:52:58,411 INFO L275 CfgBuilder]: Performing block encoding [2022-10-04 00:52:58,442 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-04 00:52:58,442 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-04 00:52:58,445 INFO L202 PluginConnector]: Adding new model queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:52:58 BoogieIcfgContainer [2022-10-04 00:52:58,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-04 00:52:58,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-04 00:52:58,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-04 00:52:58,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-04 00:52:58,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:57" (1/2) ... [2022-10-04 00:52:58,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e36349 and model type queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:52:58, skipping insertion in model container [2022-10-04 00:52:58,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:52:58" (2/2) ... [2022-10-04 00:52:58,459 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.line295.bpl [2022-10-04 00:52:58,466 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-04 00:52:58,478 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-04 00:52:58,478 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-04 00:52:58,478 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-04 00:52:58,623 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-04 00:52:58,687 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:52:58,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:52:58,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:52:58,690 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-10-04 00:52:58,695 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-10-04 00:52:58,738 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:52:58,746 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:52:58,756 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;@df6b204, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:52:58,756 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:52:58,831 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:52:58,840 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:52:58,843 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-10-04 00:52:58,867 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:52:58,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:52:58,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:52:58,873 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-10-04 00:52:58,874 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-10-04 00:52:58,878 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:52:58,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:52:58,880 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;@df6b204, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:52:58,880 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:52:59,284 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:52:59,286 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:52:59,290 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-10-04 00:52:59,298 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:52:59,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:52:59,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:52:59,337 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-10-04 00:52:59,338 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-10-04 00:52:59,342 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:52:59,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:52:59,343 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;@df6b204, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:52:59,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:52:59,343 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-04 00:52:59,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 00:52:59,344 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:52:59,344 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-10-04 00:52:59,349 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:52:59,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:52:59,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:52:59,352 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-10-04 00:52:59,356 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-10-04 00:52:59,360 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:52:59,367 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:52:59,368 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;@df6b204, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:52:59,368 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:52:59,440 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:52:59,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:52:59,445 INFO L85 PathProgramCache]: Analyzing trace with hash -944447742, now seen corresponding path program 1 times [2022-10-04 00:52:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:52:59,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130852602] [2022-10-04 00:52:59,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:52:59,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:52:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:52:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:52:59,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:52:59,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130852602] [2022-10-04 00:52:59,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130852602] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:52:59,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:52:59,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-04 00:52:59,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640532249] [2022-10-04 00:52:59,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:52:59,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-04 00:52:59,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:52:59,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-04 00:52:59,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-04 00:52:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:52:59,846 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:52:59,848 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-10-04 00:52:59,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:52:59,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:52:59,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-04 00:52:59,873 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:52:59,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:52:59,873 INFO L85 PathProgramCache]: Analyzing trace with hash -484467378, now seen corresponding path program 1 times [2022-10-04 00:52:59,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:52:59,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041810535] [2022-10-04 00:52:59,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:52:59,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:53:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:53:06,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:53:06,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041810535] [2022-10-04 00:53:06,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041810535] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:53:06,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:53:06,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-10-04 00:53:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188924854] [2022-10-04 00:53:06,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:53:06,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-04 00:53:06,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:53:06,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-04 00:53:06,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2022-10-04 00:53:06,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:06,008 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:53:06,008 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-10-04 00:53:06,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:06,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:23,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:23,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-04 00:53:23,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-04 00:53:23,720 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:53:23,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:53:23,721 INFO L85 PathProgramCache]: Analyzing trace with hash 981294747, now seen corresponding path program 1 times [2022-10-04 00:53:23,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:53:23,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997795002] [2022-10-04 00:53:23,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:23,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:53:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:53:24,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:53:24,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997795002] [2022-10-04 00:53:24,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997795002] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:53:24,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565855184] [2022-10-04 00:53:24,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:24,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:53:24,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:24,483 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-10-04 00:53:24,483 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-10-04 00:53:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:24,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 95 conjunts are in the unsatisfiable core [2022-10-04 00:53:24,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:53:24,867 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-10-04 00:53:25,084 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:53:25,085 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-10-04 00:53:25,652 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-10-04 00:53:25,898 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:53:25,899 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-10-04 00:53:25,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:53:25,984 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-10-04 00:53:26,528 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-10-04 00:53:27,098 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:53:27,098 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-10-04 00:53:27,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:53:27,313 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-10-04 00:53:27,392 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-10-04 00:53:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:53:27,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-04 00:53:27,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565855184] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:53:27,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-04 00:53:27,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [23] total 57 [2022-10-04 00:53:27,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58668669] [2022-10-04 00:53:27,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:53:27,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-10-04 00:53:27,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:53:27,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-10-04 00:53:27,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3001, Unknown=0, NotChecked=0, Total=3192 [2022-10-04 00:53:27,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:27,464 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:53:27,465 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-10-04 00:53:27,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:27,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-10-04 00:53:27,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:31,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:31,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-04 00:53:31,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-10-04 00:53:31,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-10-04 00:53:31,676 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-10-04 00:53:31,677 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:53:31,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:53:31,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1444466288, now seen corresponding path program 1 times [2022-10-04 00:53:31,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:53:31,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876573224] [2022-10-04 00:53:31,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:31,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:53:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:53:33,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:53:33,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876573224] [2022-10-04 00:53:33,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876573224] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:53:33,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555762642] [2022-10-04 00:53:33,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:33,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:53:33,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:33,567 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-10-04 00:53:33,568 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-10-04 00:53:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:33,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 125 conjunts are in the unsatisfiable core [2022-10-04 00:53:33,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:53:33,933 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-10-04 00:53:34,026 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-10-04 00:53:34,256 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:53:34,256 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-10-04 00:53:34,345 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-10-04 00:53:34,805 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-10-04 00:53:35,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:53:35,056 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-10-04 00:53:35,564 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:53:35,565 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-10-04 00:53:35,575 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-10-04 00:53:37,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:53:37,041 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 00:53:37,041 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-10-04 00:53:37,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:53:37,826 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-10-04 00:53:38,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:53:38,215 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-10-04 00:53:38,638 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-10-04 00:53:38,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:53:38,971 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-10-04 00:53:39,402 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-10-04 00:53:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:53:39,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:53:40,084 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| 1604)) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_166 (Array Int Int))) (< (+ 3 (* (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| 1604)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)))) is different from false [2022-10-04 00:53:40,117 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))) (<= 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| 1604)) 4) |c_~#queue~0.offset|))))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (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| 1604)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:53:40,174 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))) (<= 0 (+ (* (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| 1604)) 4) |c_~#queue~0.offset|))))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (forall ((v_ArrVal_166 (Array Int Int))) (< (+ (* (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| 1604)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 00:53:40,267 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:53:40,268 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-10-04 00:53:40,275 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:53:40,276 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-10-04 00:53:40,280 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-10-04 00:53:40,298 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:53:40,298 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-10-04 00:53:40,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:53:40,302 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-10-04 00:53:41,908 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|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (forall ((v_ArrVal_162 Int)) (<= 0 (+ (* (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) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4) |c_~#queue~0.offset| 4))))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (forall ((v_ArrVal_162 Int)) (< (+ 7 (* (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) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-10-04 00:53:42,589 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4)))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (forall ((v_ArrVal_162 Int)) (< (+ 7 |c_~#queue~0.offset| (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4)) (select |c_#length| |c_~#queue~0.base|))))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) is different from false [2022-10-04 00:53:49,497 WARN L233 SmtUtils]: Spent 6.66s 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-10-04 00:53:56,401 WARN L233 SmtUtils]: Spent 6.73s 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-10-04 00:54:12,164 WARN L233 SmtUtils]: Spent 15.00s 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-10-04 00:54:33,680 WARN L233 SmtUtils]: Spent 17.36s 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-10-04 00:54:51,429 WARN L233 SmtUtils]: Spent 13.49s 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-10-04 00:55:08,056 WARN L233 SmtUtils]: Spent 12.90s 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-10-04 00:55:27,069 WARN L233 SmtUtils]: Spent 12.53s 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-10-04 00:55:56,493 WARN L233 SmtUtils]: Spent 17.51s 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-10-04 00:56:16,893 WARN L233 SmtUtils]: Spent 20.21s 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-10-04 00:56:27,718 WARN L233 SmtUtils]: Spent 10.63s 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-10-04 00:56:44,511 WARN L233 SmtUtils]: Spent 9.71s 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-10-04 00:56:56,771 WARN L233 SmtUtils]: Spent 12.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-10-04 00:57:13,828 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-10-04 00:57:13,829 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 66 [2022-10-04 00:57:13,843 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:57:13,843 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 99 treesize of output 101 [2022-10-04 00:57:13,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:57:13,864 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 54 treesize of output 46 [2022-10-04 00:57:13,914 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-10-04 00:57:13,923 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:57:13,934 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:57:13,934 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 77 treesize of output 77 [2022-10-04 00:57:14,202 INFO L356 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2022-10-04 00:57:14,202 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 1 [2022-10-04 00:57:29,667 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-10-04 00:57:29,939 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:57:29,940 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-10-04 00:57:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:57:30,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555762642] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:57:30,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:57:30,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 46, 48] total 134 [2022-10-04 00:57:30,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389674887] [2022-10-04 00:57:30,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:57:30,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 135 states [2022-10-04 00:57:30,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:57:30,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2022-10-04 00:57:30,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=16118, Unknown=52, NotChecked=1300, Total=18090 [2022-10-04 00:57:30,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:30,233 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:57:30,234 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-10-04 00:57:30,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:30,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-10-04 00:57:30,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-10-04 00:57:30,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:36,989 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (let ((.cse4 (< |c_~#stored_elements~0.base| |c_~#queue~0.base|)) (.cse5 (select |c_#length| |c_~#queue~0.base|)) (.cse6 (+ |c_ULTIMATE.start_init_~q#1.offset| 1604)) (.cse9 (= (select .cse7 1604) 0))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|) 1604) 0) (not (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_read~int_#ptr#1.offset| 1604) (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 ((.cse0 (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|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (< (+ 7 (* (select (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41| v_ArrVal_160) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) .cse1) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41|)))) (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| 1604))) (or (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (< (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41|) (<= 0 (+ (* (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) 4) |c_~#queue~0.offset| 4))))) .cse4) (< .cse5 (+ |c_~#queue~0.offset| 1612))) (<= (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|) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) .cse6) 0) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= (select .cse7 (+ |c_~#queue~0.offset| 1604)) 0) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 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|) (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|) (+ |c_~#queue~0.offset| 1612)) (not (= 0 (select |c_#valid| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)))))) (<= (select |c_#length| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 4) (<= 1612 .cse5) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|) 1604) 0) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|) .cse6) 0) (let ((.cse8 (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|))) (or (and (not .cse8) .cse9) (and .cse8 (not (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 1604)) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) 1604) 0)))) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4) .cse9))) is different from false [2022-10-04 00:57:41,394 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_~#queue~0.offset| 1604)) (.cse8 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse0 (<= .cse8 4)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse7) 0)) (.cse1 (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse7) 0)) (.cse2 (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4))) (.cse6 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (or .cse0 (and .cse1 .cse2)) (= |c_t1Thread1of1ForFork1_read~int_#value#1| 0) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4)))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (= |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 (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (forall ((v_ArrVal_162 Int)) (< (+ 7 |c_~#queue~0.offset| (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4)) (select |c_#length| |c_~#queue~0.base|))))) (<= (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|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| (+ (* (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse3) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (or .cse0 (and .cse4 .cse2)) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= (select .cse5 1604) |c_t1Thread1of1ForFork1_read~int_#value#1|) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_162 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* 4 (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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))))) (= (select .cse6 .cse7) 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 1604) 0) (<= (+ |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 .cse5 .cse3)) (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) .cse4 .cse1 (= 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 (<= 1612 .cse8) (let ((.cse9 (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|))) (or (and (not .cse9) (= (select .cse6 1604) 0)) (and .cse9 (not (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 1604)) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) 1604) 0)))) (<= 4 |c_t1Thread1of1ForFork1_read~int_#sizeOfReadType#1|) (forall ((v_ArrVal_162 Int)) (< (+ 7 |c_~#queue~0.offset| (* 4 (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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (select |c_#length| |c_~#queue~0.base|))) (<= |c_~#stored_elements~0.base| 6) (<= (+ 1612 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))))) is different from false [2022-10-04 00:57:42,235 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4)))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (= |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 (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (forall ((v_ArrVal_162 Int)) (< (+ 7 |c_~#queue~0.offset| (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4)) (select |c_#length| |c_~#queue~0.base|))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1604) 0) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 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)) (<= 1612 (select |c_#length| |c_~#queue~0.base|)) (<= |c_~#stored_elements~0.base| 6) (<= (+ 1612 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:57:43,046 WARN L833 $PredicateComparison]: unable to prove that (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|)) (<= 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| 1604)) 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 (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (forall ((v_ArrVal_162 Int)) (<= 0 (+ (* (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) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4) |c_~#queue~0.offset| 4))))) (<= 1612 (select |c_#length| |c_~#queue~0.base|)) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1604) 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (forall ((v_ArrVal_162 Int)) (< (+ 7 (* (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) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))))) (<= |c_~#stored_elements~0.base| 6) (<= (+ 1612 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-10-04 00:57:43,846 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse1 (select .cse0 1604)) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |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))) (<= 0 (+ (* (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| 1604)) 4) |c_~#queue~0.offset|))))) (<= (+ 1608 (* .cse1 4)) .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)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (forall ((v_ArrVal_166 (Array Int Int))) (< (+ (* (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| 1604)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)))) (<= 1 .cse1) (<= (+ |c_~#queue~0.offset| 1612) .cse2) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-10-04 00:57:43,859 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (let ((.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse0 (select .cse2 1604))) (and (<= (+ 1608 (* .cse0 4)) .cse1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |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))) (<= 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| 1604)) 4) |c_~#queue~0.offset|))))) (= (select .cse2 (+ |c_~#queue~0.offset| 1604)) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (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| 1604)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~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)) (<= (+ |c_~#queue~0.offset| 1612) .cse1) (<= |c_~#stored_elements~0.base| 6) (<= 1 .cse0)))) is different from false [2022-10-04 00:57:44,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:44,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-04 00:57:44,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-10-04 00:57:44,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-10-04 00:57:44,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-10-04 00:57:45,063 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-10-04 00:57:45,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:57:45,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:57:45,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1770284473, now seen corresponding path program 1 times [2022-10-04 00:57:45,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:57:45,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670474702] [2022-10-04 00:57:45,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:57:45,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:57:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:57:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 58 proven. 52 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-04 00:57:45,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:57:45,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670474702] [2022-10-04 00:57:45,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670474702] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:57:45,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963536176] [2022-10-04 00:57:45,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:57:45,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:57:45,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:57:45,828 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-10-04 00:57:45,829 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-10-04 00:57:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:57:45,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 164 conjunts are in the unsatisfiable core [2022-10-04 00:57:46,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:57:46,153 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-10-04 00:57:46,225 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-10-04 00:57:46,377 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:57:46,377 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-10-04 00:57:46,464 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-10-04 00:57:46,819 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-10-04 00:57:47,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:57:47,052 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-10-04 00:57:47,665 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:57:47,665 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-10-04 00:57:47,673 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-10-04 00:57:48,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:57:48,843 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 00:57:48,843 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-10-04 00:57:49,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:57:49,350 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-10-04 00:57:49,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:57:49,694 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-10-04 00:57:50,102 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-10-04 00:57:50,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:57:50,460 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-10-04 00:57:51,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:57:51,377 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 00:57:51,378 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-10-04 00:57:51,613 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:57:51,613 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-10-04 00:57:51,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:57:51,863 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-10-04 00:57:51,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:57:51,988 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-10-04 00:57:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 60 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:57:52,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:58:15,685 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:58:15,687 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-10-04 00:58:15,698 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:58:15,698 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-10-04 00:58:15,705 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-10-04 00:58:15,716 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-10-04 00:58:15,766 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:58:15,766 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-10-04 00:58:31,731 WARN L233 SmtUtils]: Spent 5.11s 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-10-04 00:58:55,127 WARN L233 SmtUtils]: Spent 6.03s 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-10-04 00:59:11,753 WARN L233 SmtUtils]: Spent 7.20s 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-10-04 00:59:28,642 WARN L233 SmtUtils]: Spent 7.57s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:59:52,866 WARN L233 SmtUtils]: Spent 8.17s 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-10-04 01:00:04,961 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-10-04 01:00:04,962 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-10-04 01:00:04,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:00:04,971 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-10-04 01:00:04,975 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-10-04 01:00:05,030 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-10-04 01:00:05,031 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-10-04 01:00:05,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:00:05,044 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-10-04 01:00:06,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 52 treesize of output 50 [2022-10-04 01:00:06,394 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:00:06,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 58 [2022-10-04 01:00:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 60 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:06,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963536176] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 01:00:06,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 01:00:06,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 54, 53] total 124 [2022-10-04 01:00:06,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999312941] [2022-10-04 01:00:06,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 01:00:06,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 124 states [2022-10-04 01:00:06,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 01:00:06,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2022-10-04 01:00:06,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=14480, Unknown=130, NotChecked=0, Total=15252 [2022-10-04 01:00:06,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:06,673 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 01:00:06,674 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-10-04 01:00:06,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:06,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-10-04 01:00:06,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-10-04 01:00:06,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-10-04 01:00:06,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:11,486 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (< |c_~#stored_elements~0.base| |c_~#queue~0.base|))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (and (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) .cse3)) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (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) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (or .cse0 (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|) (+ |c_~#queue~0.offset| 1612)))) (= |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|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse1) 0) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (<= (+ 1608 |c_~#queue~0.offset|) |c_ULTIMATE.start_write~int_#ptr#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (<= 1612 .cse2) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (or .cse0 (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|) (+ |c_~#queue~0.offset| 1612)) (not (= 0 (select |c_#valid| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)))))) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= (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| 1604)) 0) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= (+ 1612 (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (+ .cse2 |c_ULTIMATE.start_write~int_#sizeOfWrittenType#1| |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (or (and (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_21| Int)) (or (not (<= (+ 1608 |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 (= 399 (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| 1604))))))) .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| 1604)) 4) 1600)) (not (<= (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) |v_ULTIMATE.start_write~int_#ptr#1.offset_21|))))) (< .cse2 (+ |c_~#queue~0.offset| 1612))) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4)))) is different from false [2022-10-04 01:00:15,302 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (< |c_~#stored_elements~0.base| |c_~#queue~0.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse8 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse0 (<= .cse8 4)) (.cse2 (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4))) (.cse1 (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse6) 0)) (.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse4)) (.cse3 (and (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) .cse7))) (and (or .cse0 (and .cse1 .cse2)) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|) 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|)) (or .cse3 (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|) (+ |c_~#queue~0.offset| 1612)))) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse4)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= 400 .cse5)) (or .cse0 (and (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse6) 0) .cse2)) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |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|) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse6) 0) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|))) (or (and (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| 1604)) 399))) .cse7 (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| 1604)) 4) 1600))) (< .cse8 (+ |c_~#queue~0.offset| 1612))) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse5) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (not (= 400 |c_t1Thread1of1ForFork1_read~int_#value#1|)) (= .cse4 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) .cse1 (= 7 |c_~#queue~0.base|) (<= 1612 .cse8) (or .cse3 (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|) (+ |c_~#queue~0.offset| 1612)) (not (= 0 (select |c_#valid| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)))))) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse5) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46| Int) (v_ArrVal_253 Int)) (or (not (= 400 (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) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46|)))) (<= |c_~#stored_elements~0.base| 6) (or .cse3 (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_237 Int)) (or (not (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 0)) (< (select (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_237) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1612)))))))) is different from false [2022-10-04 01:00:16,546 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_~#queue~0.base|))) (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|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (or (<= .cse0 4) (and (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 0) (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4)))) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (<= 1612 .cse0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46| Int) (v_ArrVal_253 Int)) (or (not (= 400 (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) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46|)))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-10-04 01:00:21,692 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (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|)) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) 1604) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) 1604) 1) (= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (or (< .cse0 (+ 1612 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_47| Int) (v_ArrVal_251 Int)) (or (not (= 400 (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_47| v_ArrVal_251) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (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|)))))) (= 7 |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) (<= 1612 .cse0) (= (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) (<= 1612 (select |c_#length| |c_~#queue~0.base|)) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| 7) .cse1) 1) (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= (select (select |c_#memory_int| 7) .cse1) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1604) 1))) is different from false [2022-10-04 01:00:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 01:00:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-04 01:00:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-10-04 01:00:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-10-04 01:00:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-10-04 01:00:22,030 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-10-04 01:00:22,219 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-10-04 01:00:22,220 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 01:00:22,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 01:00:22,220 INFO L85 PathProgramCache]: Analyzing trace with hash 252233874, now seen corresponding path program 2 times [2022-10-04 01:00:22,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 01:00:22,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543504940] [2022-10-04 01:00:22,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 01:00:22,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 01:00:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 01:00:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:00:26,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 01:00:26,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543504940] [2022-10-04 01:00:26,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543504940] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 01:00:26,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051614847] [2022-10-04 01:00:26,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 01:00:26,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 01:00:26,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 01:00:26,176 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-10-04 01:00:26,177 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-10-04 01:00:26,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-04 01:00:26,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 01:00:26,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 216 conjunts are in the unsatisfiable core [2022-10-04 01:00:26,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 01:00:26,562 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-10-04 01:00:26,795 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-10-04 01:00:26,907 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-10-04 01:00:27,221 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 01:00:27,221 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-10-04 01:00:27,350 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-10-04 01:00:28,062 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-10-04 01:00:31,350 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-10-04 01:00:32,289 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-10-04 01:00:45,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:00:45,493 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-10-04 01:01:04,561 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 36 treesize of output 29 [2022-10-04 01:01:24,019 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 46 treesize of output 41 [2022-10-04 01:02:27,188 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 47 treesize of output 43 [2022-10-04 01:02:29,888 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-10-04 01:02:31,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:02:31,523 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 54 treesize of output 56 [2022-10-04 01:03:23,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:03:23,855 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 01:03:23,855 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 72 treesize of output 65 [2022-10-04 01:03:44,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:03:44,819 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 72 treesize of output 65 [2022-10-04 01:03:55,803 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 70 treesize of output 52 [2022-10-04 01:03:57,776 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-10-04 01:03:59,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 01:03:59,524 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 67 treesize of output 67 [2022-10-04 01:04:00,806 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 70 treesize of output 52 [2022-10-04 01:04:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 90 refuted. 46 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 01:04:01,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 01:04:02,458 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_347 (Array Int Int))) (< (+ 3 |c_~#queue~0.offset| (* 4 (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_347) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)))) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_347 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_347) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-10-04 01:04:02,481 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_347 (Array Int Int))) (< (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_347) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~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_347 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_347) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|)))))) is different from false [2022-10-04 01:04:02,501 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| Int)) (or (forall ((v_ArrVal_347 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_347) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) |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 (forall ((v_ArrVal_347 (Array Int Int))) (< (+ (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_347) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 01:04:02,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:04:02,597 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-10-04 01:04:02,608 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:04:02,608 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-10-04 01:04:02,631 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-10-04 01:04:02,659 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:04:02,659 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-10-04 01:04:02,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 01:04:02,665 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-10-04 01:04:05,638 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|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int)) (or (forall ((v_ArrVal_344 Int)) (< (+ 7 (* 4 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|)))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int)) (or (forall ((v_ArrVal_344 Int)) (<= 0 (+ (* 4 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) |c_~#queue~0.offset| 4))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|))))) is different from false [2022-10-04 01:04:06,696 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_57| Int)) (or (forall ((v_ArrVal_344 Int)) (<= 0 (+ (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4) |c_~#queue~0.offset| 4))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|)))) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int)) (or (forall ((v_ArrVal_344 Int)) (< (+ 7 (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|))))) is different from false [2022-10-04 01:04:08,266 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_57| Int) (v_ArrVal_342 Int)) (or (forall ((v_ArrVal_344 Int)) (< (+ 7 (* (select (store (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_342)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|)))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (v_ArrVal_342 Int)) (or (forall ((v_ArrVal_344 Int)) (<= 0 (+ (* (select (store (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_342)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4) |c_~#queue~0.offset| 4))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|)))) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) is different from false [2022-10-04 01:04:18,304 WARN L233 SmtUtils]: Spent 9.74s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:04:43,004 WARN L233 SmtUtils]: Spent 24.43s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:05:09,058 WARN L233 SmtUtils]: Spent 23.66s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 01:05:26,443 WARN L233 SmtUtils]: Spent 17.07s 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-10-04 01:05:45,926 WARN L233 SmtUtils]: Spent 19.20s 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-10-04 01:06:09,358 WARN L233 SmtUtils]: Spent 23.04s 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-10-04 01:06:29,778 WARN L233 SmtUtils]: Spent 20.06s 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-10-04 01:06:40,992 WARN L233 SmtUtils]: Spent 10.87s 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-10-04 01:06:41,867 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| Int) (v_ArrVal_344 Int) (v_ArrVal_342 Int) (v_ArrVal_340 (Array Int Int))) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_340) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58|) (< (+ (* (select (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| v_ArrVal_342) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) .cse1) 4) 7 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)) (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|))))) (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 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| Int) (v_ArrVal_344 Int) (v_ArrVal_342 Int) (v_ArrVal_340 (Array Int Int))) (let ((.cse2 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_340) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (<= 0 (+ (* (select (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| v_ArrVal_342) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) .cse3) 4) |c_~#queue~0.offset| 4)) (< (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58|) (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)))) (or (forall ((v_ArrVal_340 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (< (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_340) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) 0) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)))) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)))) is different from false [2022-10-04 01:06:41,951 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_340 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (< (+ (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_340) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) 0) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)))) (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_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| Int) (v_ArrVal_344 Int) (v_ArrVal_342 Int) (v_ArrVal_340 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_340) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58|) (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|)) (<= 0 (+ (* (select (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| v_ArrVal_342) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) .cse1) 4) |c_~#queue~0.offset| 4))))))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| Int) (v_ArrVal_344 Int) (v_ArrVal_342 Int) (v_ArrVal_340 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_340) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58|) (< (+ 7 (* (select (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| v_ArrVal_342) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) .cse3) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)) (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 01:06:42,291 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:06:42,292 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 176 treesize of output 145 [2022-10-04 01:06:42,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:06:42,303 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 246 treesize of output 242 [2022-10-04 01:06:42,309 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 393 treesize of output 381 [2022-10-04 01:06:42,315 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 533 treesize of output 521 [2022-10-04 01:06:42,327 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 521 treesize of output 517 [2022-10-04 01:06:42,352 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-10-04 01:06:42,463 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 01:06:42,464 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 222 treesize of output 214 [2022-10-04 01:06:46,119 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= 400 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))))))) (and (or (not (<= 0 (+ |c_~#queue~0.offset| 1604))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (let ((.cse0 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (or (< .cse0 400) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= 400 .cse0))))) (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse1) (or (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) .cse1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int)) (or (forall ((v_ArrVal_337 Int)) (let ((.cse3 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (let ((.cse2 (* .cse3 4))) (or (< (+ |c_~#queue~0.offset| 4 .cse2) 0) (< (+ |c_~#queue~0.offset| .cse2 11) (select |c_#length| |c_~#queue~0.base|)) (= 400 .cse3))))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1))) is different from false [2022-10-04 01:06:46,986 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 400))))) (and (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (forall ((v_ArrVal_337 Int)) (let ((.cse2 (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (let ((.cse1 (* .cse2 4))) (or (< (+ .cse1 |c_~#queue~0.offset| 4) 0) (= .cse2 400) (< (+ .cse1 |c_~#queue~0.offset| 11) (select |c_#length| |c_~#queue~0.base|)))))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) (or (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) .cse0) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (let ((.cse3 (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= .cse3 400) (< .cse3 400)))) (not (<= 0 (+ |c_~#queue~0.offset| 1604)))))) is different from false [2022-10-04 01:06:48,405 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= 400 (select (store (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_335)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))))))) (and (or .cse0 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int)) (or (forall ((v_ArrVal_337 Int)) (let ((.cse2 (select (store (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_335)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (let ((.cse1 (* .cse2 4))) (or (< (+ |c_~#queue~0.offset| .cse1 11) (select |c_#length| |c_~#queue~0.base|)) (= 400 .cse2) (< (+ |c_~#queue~0.offset| .cse1 4) 0))))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))) (or (not (<= 0 (+ |c_~#queue~0.offset| 1604))) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (let ((.cse3 (select (store (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_335)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= 400 .cse3) (< .cse3 400))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse0))) is different from false [2022-10-04 01:06:49,464 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (or (= 400 (select (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))))) (and (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse0) (or (not (<= 0 (+ |c_~#queue~0.offset| 1604))) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (let ((.cse1 (select (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (or (= 400 .cse1) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (< .cse1 400))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (forall ((v_ArrVal_337 Int)) (let ((.cse2 (select (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (let ((.cse3 (* .cse2 4))) (or (= 400 .cse2) (< (+ |c_~#queue~0.offset| .cse3 11) (select |c_#length| |c_~#queue~0.base|)) (< (+ |c_~#queue~0.offset| .cse3 4) 0))))))) (or .cse0 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 01:06:50,367 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 400))))) (and (or (not (<= 0 (+ |c_~#queue~0.offset| 1604))) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (let ((.cse0 (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (or (< .cse0 400) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= .cse0 400))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse1) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int)) (or (forall ((v_ArrVal_337 Int)) (let ((.cse3 (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (let ((.cse2 (* .cse3 4))) (or (< (+ |c_~#queue~0.offset| .cse2 11) (select |c_#length| |c_~#queue~0.base|)) (< (+ |c_~#queue~0.offset| 4 .cse2) 0) (= .cse3 400))))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))) (or (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) .cse1))) is different from false [2022-10-04 01:06:51,301 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (or (= 400 (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))))) (and (or (not (<= 0 (+ |c_~#queue~0.offset| 1604))) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (let ((.cse0 (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (or (< .cse0 400) (= 400 .cse0) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))))) (or .cse1 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse1) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (forall ((v_ArrVal_337 Int)) (let ((.cse2 (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (let ((.cse3 (* .cse2 4))) (or (= 400 .cse2) (< (+ .cse3 |c_~#queue~0.offset| 4) 0) (< (+ .cse3 |c_~#queue~0.offset| 11) (select |c_#length| |c_~#queue~0.base|)))))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1))) is different from false [2022-10-04 01:06:52,131 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (or (= 400 (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* (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|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))))) (and (or .cse0 (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (or (not (<= 0 (+ |c_~#queue~0.offset| 1604))) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (let ((.cse1 (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* (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|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (or (= 400 .cse1) (< .cse1 400) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))))) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int)) (or (forall ((v_ArrVal_337 Int)) (let ((.cse2 (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* (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|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (let ((.cse3 (* .cse2 4))) (or (= 400 .cse2) (< (+ |c_~#queue~0.offset| .cse3 11) (select |c_#length| |c_~#queue~0.base|)) (< (+ |c_~#queue~0.offset| .cse3 4) 0))))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))) (or .cse0 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (or .cse0 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))))) is different from false [2022-10-04 01:06:53,018 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= 400 (let ((.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (select (store (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse8 (+ (* (select .cse8 .cse9) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) .cse9))))))) (and (or .cse0 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (or .cse0 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (or (not (<= 0 (+ |c_~#queue~0.offset| 1604))) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (let ((.cse1 (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (select (store (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) .cse3)))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= 400 .cse1) (< .cse1 400))))) (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse0) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (forall ((v_ArrVal_337 Int)) (let ((.cse5 (let ((.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (select (store (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse6 (+ (* (select .cse6 .cse7) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) .cse7)))) (let ((.cse4 (* 4 .cse5))) (or (< (+ .cse4 |c_~#queue~0.offset| 4) 0) (= 400 .cse5) (< (+ .cse4 |c_~#queue~0.offset| 11) (select |c_#length| |c_~#queue~0.base|)))))))))) is different from false Received shutdown request... [2022-10-04 01:07:04,888 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-10-04 01:07:04,888 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-10-04 01:07:04,888 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-10-04 01:07:04,888 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-10-04 01:07:04,888 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-10-04 01:07:04,917 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-10-04 01:07:05,172 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 01:07:05,193 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-10-04 01:07:05,373 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-10-04 01:07:05,373 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 401 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 198 known predicates. [2022-10-04 01:07:05,375 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-10-04 01:07:05,375 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was TIMEOUT (4/4) [2022-10-04 01:07:05,377 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-04 01:07:05,377 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-04 01:07:05,380 INFO L202 PluginConnector]: Adding new model queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 01:07:05 BasicIcfg [2022-10-04 01:07:05,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-04 01:07:05,381 INFO L158 Benchmark]: Toolchain (without parser) took 848045.61ms. Allocated memory was 185.6MB in the beginning and 437.3MB in the end (delta: 251.7MB). Free memory was 134.6MB in the beginning and 205.5MB in the end (delta: -70.9MB). Peak memory consumption was 181.0MB. Max. memory is 8.0GB. [2022-10-04 01:07:05,381 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.49ms. Allocated memory is still 185.6MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-04 01:07:05,381 INFO L158 Benchmark]: Boogie Preprocessor took 102.96ms. Allocated memory is still 185.6MB. Free memory was 134.5MB in the beginning and 131.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-04 01:07:05,381 INFO L158 Benchmark]: RCFGBuilder took 995.73ms. Allocated memory was 185.6MB in the beginning and 256.9MB in the end (delta: 71.3MB). Free memory was 130.6MB in the beginning and 203.9MB in the end (delta: -73.4MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. [2022-10-04 01:07:05,382 INFO L158 Benchmark]: TraceAbstraction took 846933.35ms. Allocated memory was 256.9MB in the beginning and 437.3MB in the end (delta: 180.4MB). Free memory was 203.4MB in the beginning and 205.5MB in the end (delta: -2.1MB). Peak memory consumption was 178.8MB. Max. memory is 8.0GB. [2022-10-04 01:07:05,382 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.49ms. Allocated memory is still 185.6MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 102.96ms. Allocated memory is still 185.6MB. Free memory was 134.5MB in the beginning and 131.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 995.73ms. Allocated memory was 185.6MB in the beginning and 256.9MB in the end (delta: 71.3MB). Free memory was 130.6MB in the beginning and 203.9MB in the end (delta: -73.4MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. * TraceAbstraction took 846933.35ms. Allocated memory was 256.9MB in the beginning and 437.3MB in the end (delta: 180.4MB). Free memory was 203.4MB in the beginning and 205.5MB in the end (delta: -2.1MB). Peak memory consumption was 178.8MB. 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 198 known predicates. - 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.1s, 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.4s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.4s, 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: 846.0s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 51.8s, 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.6s SatisfiabilityAnalysisTime, 389.3s InterpolantComputationTime, 2422 NumberOfCodeBlocks, 2422 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 3109 ConstructedInterpolants, 558 QuantifiedInterpolants, 77556 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