/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.line384.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-04 00:53:47,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-04 00:53:47,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-04 00:53:47,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-04 00:53:47,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-04 00:53:47,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-04 00:53:47,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-04 00:53:47,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-04 00:53:47,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-04 00:53:47,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-04 00:53:47,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-04 00:53:47,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-04 00:53:47,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-04 00:53:47,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-04 00:53:47,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-04 00:53:47,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-04 00:53:47,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-04 00:53:47,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-04 00:53:47,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-04 00:53:47,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-04 00:53:47,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-04 00:53:47,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-04 00:53:47,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-04 00:53:47,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-04 00:53:47,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-04 00:53:47,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-04 00:53:47,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-04 00:53:47,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-04 00:53:47,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-04 00:53:47,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-04 00:53:47,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-04 00:53:47,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-04 00:53:47,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-04 00:53:47,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-04 00:53:47,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-04 00:53:47,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-04 00:53:47,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-04 00:53:47,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-04 00:53:47,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-04 00:53:47,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-04 00:53:47,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-04 00:53:47,106 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:53:47,134 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-04 00:53:47,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-04 00:53:47,134 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-04 00:53:47,134 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-04 00:53:47,134 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-04 00:53:47,135 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-04 00:53:47,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-04 00:53:47,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-04 00:53:47,135 INFO L138 SettingsManager]: * Use SBE=true [2022-10-04 00:53:47,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-04 00:53:47,135 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-04 00:53:47,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-04 00:53:47,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-04 00:53:47,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-04 00:53:47,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-04 00:53:47,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-04 00:53:47,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-04 00:53:47,136 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-04 00:53:47,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-04 00:53:47,136 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-04 00:53:47,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-04 00:53:47,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-04 00:53:47,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-04 00:53:47,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-04 00:53:47,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-04 00:53:47,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:53:47,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-04 00:53:47,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-04 00:53:47,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-04 00:53:47,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-04 00:53:47,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-04 00:53:47,137 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-04 00:53:47,137 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-04 00:53:47,137 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-04 00:53:47,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-04 00:53:47,137 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-04 00:53:47,138 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-04 00:53:47,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-04 00:53:47,138 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:53:47,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-04 00:53:47,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-04 00:53:47,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-04 00:53:47,346 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-04 00:53:47,347 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-04 00:53:47,347 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.line384.bpl [2022-10-04 00:53:47,347 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longer.line384.bpl' [2022-10-04 00:53:47,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-04 00:53:47,393 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-04 00:53:47,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-04 00:53:47,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-04 00:53:47,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-04 00:53:47,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_ok_longer.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:47" (1/1) ... [2022-10-04 00:53:47,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_ok_longer.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:47" (1/1) ... [2022-10-04 00:53:47,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_ok_longer.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:47" (1/1) ... [2022-10-04 00:53:47,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_ok_longer.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:47" (1/1) ... [2022-10-04 00:53:47,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_ok_longer.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:47" (1/1) ... [2022-10-04 00:53:47,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_ok_longer.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:47" (1/1) ... [2022-10-04 00:53:47,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_ok_longer.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:47" (1/1) ... [2022-10-04 00:53:47,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-04 00:53:47,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-04 00:53:47,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-04 00:53:47,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-04 00:53:47,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_ok_longer.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:47" (1/1) ... [2022-10-04 00:53:47,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-04 00:53:47,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:47,499 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:53:47,503 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:53:47,527 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-10-04 00:53:47,527 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-10-04 00:53:47,527 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-10-04 00:53:47,527 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-10-04 00:53:47,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-04 00:53:47,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-04 00:53:47,529 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:53:47,642 INFO L234 CfgBuilder]: Building ICFG [2022-10-04 00:53:47,643 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-04 00:53:48,163 INFO L275 CfgBuilder]: Performing block encoding [2022-10-04 00:53:48,181 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-04 00:53:48,181 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-04 00:53:48,183 INFO L202 PluginConnector]: Adding new model queue_ok_longer.line384.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:48 BoogieIcfgContainer [2022-10-04 00:53:48,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-04 00:53:48,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-04 00:53:48,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-04 00:53:48,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-04 00:53:48,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longer.line384.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:47" (1/2) ... [2022-10-04 00:53:48,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184f59fd and model type queue_ok_longer.line384.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:53:48, skipping insertion in model container [2022-10-04 00:53:48,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longer.line384.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:48" (2/2) ... [2022-10-04 00:53:48,202 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.line384.bpl [2022-10-04 00:53:48,209 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-04 00:53:48,216 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-04 00:53:48,216 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-04 00:53:48,216 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-04 00:53:48,340 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-04 00:53:48,391 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:53:48,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:53:48,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:48,395 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:53:48,396 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:53:48,427 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:53:48,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:53:48,438 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;@628cdceb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:53:48,438 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:53:48,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:53:48,780 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:53:48,782 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-10-04 00:53:48,794 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:53:48,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:53:48,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:48,795 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:53:48,798 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:53:48,801 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:53:48,801 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-04 00:53:48,802 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;@628cdceb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:53:48,802 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:53:48,819 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-04 00:53:48,821 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:53:48,824 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-10-04 00:53:48,830 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:53:48,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:53:48,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:48,872 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:53:48,873 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:53:48,882 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:53:48,883 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:53:48,883 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;@628cdceb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:53:48,883 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:53:48,884 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-04 00:53:48,884 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-04 00:53:48,884 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-04 00:53:48,884 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-10-04 00:53:48,891 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-04 00:53:48,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-04 00:53:48,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:53:48,893 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:53:48,894 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:53:48,897 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-04 00:53:48,897 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-10-04 00:53:48,897 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;@628cdceb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-04 00:53:48,898 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-04 00:53:48,971 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:53:48,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:53:48,974 INFO L85 PathProgramCache]: Analyzing trace with hash 812657596, now seen corresponding path program 1 times [2022-10-04 00:53:48,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:53:48,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310637033] [2022-10-04 00:53:48,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:48,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:53:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:49,322 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:49,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:53:49,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310637033] [2022-10-04 00:53:49,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310637033] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:53:49,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:53:49,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-04 00:53:49,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336938532] [2022-10-04 00:53:49,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:53:49,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-04 00:53:49,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:53:49,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-04 00:53:49,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-04 00:53:49,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:49,359 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:53:49,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 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:49,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:49,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:49,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-04 00:53:49,390 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:53:49,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:53:49,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1025703088, now seen corresponding path program 1 times [2022-10-04 00:53:49,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:53:49,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806104985] [2022-10-04 00:53:49,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:49,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:53:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:50,467 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:50,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:53:50,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806104985] [2022-10-04 00:53:50,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806104985] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:53:50,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:53:50,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-10-04 00:53:50,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806566583] [2022-10-04 00:53:50,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:53:50,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-04 00:53:50,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:53:50,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-04 00:53:50,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2022-10-04 00:53:50,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:50,473 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:53:50,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.612903225806452) internal successors, (267), 31 states have internal predecessors, (267), 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:50,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:50,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:52,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:52,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-04 00:53:52,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-04 00:53:52,843 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:53:52,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:53:52,843 INFO L85 PathProgramCache]: Analyzing trace with hash 2105235900, now seen corresponding path program 1 times [2022-10-04 00:53:52,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:53:52,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006211325] [2022-10-04 00:53:52,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:52,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:53:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:53:53,248 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:53,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:53:53,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006211325] [2022-10-04 00:53:53,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006211325] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-04 00:53:53,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-04 00:53:53,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-10-04 00:53:53,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844192994] [2022-10-04 00:53:53,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-04 00:53:53,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-04 00:53:53,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:53:53,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-04 00:53:53,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-10-04 00:53:53,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:53,251 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:53:53,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 18.533333333333335) internal successors, (278), 16 states have internal predecessors, (278), 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:53,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:53,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-04 00:53:53,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:53,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:53:53,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-04 00:53:53,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-04 00:53:53,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-04 00:53:53,786 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:53:53,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:53:53,787 INFO L85 PathProgramCache]: Analyzing trace with hash -427880057, now seen corresponding path program 1 times [2022-10-04 00:53:53,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:53:53,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584176505] [2022-10-04 00:53:53,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:53:53,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:53:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:54:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:54:07,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:54:07,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584176505] [2022-10-04 00:54:07,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584176505] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:54:07,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874835908] [2022-10-04 00:54:07,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:54:07,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:54:07,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:54:07,520 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:54:07,521 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:54:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:54:07,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 158 conjunts are in the unsatisfiable core [2022-10-04 00:54:07,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:54:07,991 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:54:08,105 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:54:08,381 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:54:08,381 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:54:08,482 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:54:09,013 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:54:09,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:54:09,366 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:54:10,118 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-04 00:54:10,119 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:54:10,156 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:54:11,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:54:11,675 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-04 00:54:11,675 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:54:12,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:54:12,276 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:54:13,988 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 53 treesize of output 31 [2022-10-04 00:54:14,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:54:14,518 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 38 treesize of output 38 [2022-10-04 00:54:15,619 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-04 00:54:15,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 43 [2022-10-04 00:54:15,885 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-04 00:54:15,886 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:54:16,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-04 00:54:16,156 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:54:16,248 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:54:16,369 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:54:16,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:54:44,352 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-10-04 00:54:44,353 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 206 treesize of output 112 [2022-10-04 00:54:44,366 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:54:44,367 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 160 treesize of output 160 [2022-10-04 00:54:44,374 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 70 treesize of output 62 [2022-10-04 00:54:44,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:54:44,385 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 85 treesize of output 73 [2022-10-04 00:54:44,428 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 5 treesize of output 3 [2022-10-04 00:54:44,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-04 00:54:44,508 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:54:44,509 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 141 treesize of output 133 [2022-10-04 00:54:46,455 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 00:54:46,709 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:54:46,710 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:54:47,019 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:54:47,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874835908] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:54:47,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:54:47,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 59, 60] total 178 [2022-10-04 00:54:47,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848968188] [2022-10-04 00:54:47,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:54:47,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 178 states [2022-10-04 00:54:47,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:54:47,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2022-10-04 00:54:47,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=29857, Unknown=460, NotChecked=0, Total=31506 [2022-10-04 00:54:47,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:47,031 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:54:47,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 178 states, 178 states have (on average 5.095505617977528) internal successors, (907), 178 states have internal predecessors, (907), 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:54:47,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:54:47,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-04 00:54:47,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-04 00:54:47,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:56:13,685 WARN L233 SmtUtils]: Spent 5.31s on a formula simplification. DAG size of input: 338 DAG size of output: 142 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:56:23,535 WARN L233 SmtUtils]: Spent 5.09s on a formula simplification. DAG size of input: 296 DAG size of output: 153 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-04 00:56:26,727 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 ((as const (Array Int Int)) 0))) (let ((.cse42 (@diff .cse21 .cse8))) (let ((.cse31 (store .cse21 .cse42 0)) (.cse18 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse35 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|)) (.cse32 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|))) (let ((.cse41 (@diff .cse32 .cse8)) (.cse40 (@diff .cse35 .cse8)) (.cse17 (@diff .cse18 .cse8)) (.cse30 (@diff .cse31 .cse8))) (let ((.cse50 (store .cse31 .cse30 0)) (.cse38 (store .cse18 .cse17 0)) (.cse26 (store .cse35 .cse40 0)) (.cse34 (store .cse32 .cse41 0))) (let ((.cse22 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse33 (@diff .cse34 .cse8)) (.cse27 (@diff .cse26 .cse8)) (.cse39 (@diff .cse38 .cse8)) (.cse49 (@diff .cse50 .cse8))) (let ((.cse36 (+ |c_~#queue~0.offset| 1604)) (.cse48 (select |c_#length| |c_~#queue~0.base|)) (.cse20 (store .cse50 .cse49 0)) (.cse29 (store .cse38 .cse39 0)) (.cse9 (store .cse26 .cse27 0)) (.cse24 (store .cse34 .cse33 0)) (.cse54 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| 7) .cse22)) (.cse23 (select .cse18 .cse22)) (.cse7 (select (select |c_#memory_int| 7) .cse22))) (let ((.cse15 (<= .cse7 1)) (.cse12 (<= (select |c_#length| 7) 4)) (.cse6 (+ (* .cse23 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse16 (< (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1612 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (.cse13 (<= .cse54 1)) (.cse25 (@diff .cse24 .cse8)) (.cse10 (@diff .cse9 .cse8)) (.cse37 (+ |c_ULTIMATE.start_init_~q#1.offset| 1604)) (.cse11 (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (.cse28 (@diff .cse29 .cse8)) (.cse19 (@diff .cse20 .cse8)) (.cse5 (< .cse48 (+ |c_~#queue~0.offset| 1612))) (.cse46 (<= .cse48 4)) (.cse47 (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse36)) (.cse14 (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4)))) (and (or (forall ((v_ArrVal_147 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int) (v_ArrVal_151 (Array Int Int)) (v_ArrVal_144 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| Int)) (let ((.cse3 (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_142)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_144))) (let ((.cse1 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse1 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| v_ArrVal_145) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_147)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse4 .cse2))) (or (= 400 .cse0) (< (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44|) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse2 (+ .cse0 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) .cse2) 400) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| |c_~#stored_elements~0.base|)))))))) .cse5) (= .cse6 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (not (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (not (= .cse7 401)) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 0) (= .cse8 (store .cse9 .cse10 0)) (<= .cse11 4) (or .cse12 (and .cse13 .cse14)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) .cse15 (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (or (forall ((v_ArrVal_152 Int)) (< (select (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_152) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 400)) .cse16) (or (and .cse15 .cse14) .cse12) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (or (<= 1608 .cse17) (= .cse8 .cse18) (<= .cse17 1600)) (or (<= .cse19 1600) (= .cse8 .cse20) (<= 1608 .cse19) (and (<= (select .cse21 .cse19) 0) (<= .cse19 .cse22))) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse23) (= .cse8 (store .cse24 .cse25 0)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= 400 (select .cse21 .cse22))) (or (= .cse8 .cse26) (<= .cse27 1600) (<= 1608 .cse27)) (or (<= .cse28 1600) (= .cse8 .cse29) (<= 1608 .cse28)) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| .cse6) (= |c_~#queue~0.offset| 0) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| 1) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (or (<= .cse30 1600) (= .cse8 .cse31) (and (<= (select .cse21 .cse30) 0) (<= .cse30 .cse22)) (<= 1608 .cse30)) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_151 (Array Int Int))) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| |c_~#stored_elements~0.base|)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_read~int_#value#1| 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 400))) .cse5) (not (= 400 (select .cse21 1604))) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (or (and (<= (select .cse32 .cse33) 0) (<= .cse33 .cse22)) (<= 1608 .cse33) (<= .cse33 1600) (= .cse8 .cse34)) (<= (select .cse35 .cse36) 0) (or .cse16 (forall ((v_ArrVal_152 Int)) (< (select (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_152) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 400))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) .cse37) 0) (or (= .cse8 .cse38) (<= .cse39 1600) (<= 1608 .cse39)) .cse13 (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (not (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (or (<= 1608 .cse40) (<= .cse40 1600) (= .cse8 .cse35)) (or (and (<= .cse25 .cse22) (<= (select .cse32 .cse25) 0)) (<= 1608 .cse25) (= .cse8 .cse24) (<= .cse25 1600)) (= 7 |c_~#queue~0.base|) (or (<= .cse41 1600) (<= 1608 .cse41) (= .cse8 .cse32) (and (<= (select .cse32 .cse41) 0) (<= .cse41 .cse22))) (or (<= 1608 .cse42) (and (<= (select .cse21 .cse42) 0) (<= .cse42 .cse22)) (<= .cse42 1600) (= .cse8 .cse21)) (<= (select |c_#length| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 4) (= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| 0) (or (forall ((v_ArrVal_147 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_145 Int) (v_ArrVal_151 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| Int)) (let ((.cse43 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| v_ArrVal_145) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_147)) (.cse44 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse45 (select .cse43 .cse44))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse43 .cse44 (+ .cse45 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 400) (= 400 .cse45) (< (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44|) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| |c_~#stored_elements~0.base|)))))) .cse5) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (or (<= .cse10 1600) (= .cse8 .cse9) (<= 1608 .cse10)) (or (and (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (< |c_~#stored_elements~0.base| |c_~#queue~0.base|)) (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_139 Int)) (or (< (select (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_139) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1612)) (not (= 0 (select |c_#valid| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)))))) (<= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|) .cse37) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (or .cse46 (and (<= .cse47 0) .cse14)) (= .cse23 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) (not (= .cse48 .cse11)) (= .cse8 (store .cse29 .cse28 0)) (or (<= 1608 .cse49) (= .cse8 .cse50) (<= .cse49 1600) (and (<= (select .cse21 .cse49) 0) (<= .cse49 .cse22))) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= .cse8 (store .cse20 .cse19 0)) (or .cse46 (and (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse36) 0) .cse14)) (or (forall ((v_ArrVal_147 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| Int) (v_ArrVal_145 Int) (v_ArrVal_151 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| Int)) (let ((.cse51 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| v_ArrVal_145) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43| v_ArrVal_147)) (.cse52 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse53 (select .cse51 .cse52))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_43|)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse51 .cse52 (+ .cse53 1))) |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| v_ArrVal_151) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 400) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_44| (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (= 400 .cse53) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_51| |c_~#stored_elements~0.base|)))))) .cse5) (not (= .cse47 401)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (not (= .cse54 401)) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| 1) (or .cse46 (and (<= .cse47 1) .cse14)) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4)))))))))) is different from true [2022-10-04 00:56:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:56:54,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-04 00:56:54,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-04 00:56:54,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-10-04 00:56:54,991 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:56:55,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:56:55,173 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:56:55,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:56:55,174 INFO L85 PathProgramCache]: Analyzing trace with hash -105076603, now seen corresponding path program 1 times [2022-10-04 00:56:55,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:56:55,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867367977] [2022-10-04 00:56:55,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:56:55,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:56:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:56:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:56:55,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:56:55,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867367977] [2022-10-04 00:56:55,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867367977] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:56:55,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540452278] [2022-10-04 00:56:55,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:56:55,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:56:55,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:56:55,560 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:56:55,561 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:56:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:56:55,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 79 conjunts are in the unsatisfiable core [2022-10-04 00:56:55,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:56:56,881 INFO L356 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2022-10-04 00:56:56,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 69 [2022-10-04 00:56:57,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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:56:57,465 INFO L356 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2022-10-04 00:56:57,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 39 [2022-10-04 00:56:57,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:57:00,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:57:12,065 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:57:12,065 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 157 treesize of output 159 [2022-10-04 00:57:12,450 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:57:12,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540452278] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:57:12,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:57:12,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 36, 17] total 66 [2022-10-04 00:57:12,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475001257] [2022-10-04 00:57:12,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:57:12,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-10-04 00:57:12,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:57:12,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-10-04 00:57:12,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=4018, Unknown=0, NotChecked=0, Total=4422 [2022-10-04 00:57:12,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:12,457 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:57:12,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 15.893939393939394) internal successors, (1049), 67 states have internal predecessors, (1049), 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:12,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:12,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-04 00:57:12,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-04 00:57:12,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2022-10-04 00:57:12,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:17,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:17,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-10-04 00:57:17,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-04 00:57:17,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-10-04 00:57:17,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-10-04 00:57:17,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-04 00:57:17,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:57:17,380 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-10-04 00:57:17,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-04 00:57:17,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1802644901, now seen corresponding path program 2 times [2022-10-04 00:57:17,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-04 00:57:17,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723211573] [2022-10-04 00:57:17,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-04 00:57:17,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-04 00:57:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-04 00:57:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 216 proven. 183 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-10-04 00:57:18,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-04 00:57:18,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723211573] [2022-10-04 00:57:18,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723211573] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-04 00:57:18,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852003987] [2022-10-04 00:57:18,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-04 00:57:18,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-04 00:57:18,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-04 00:57:18,002 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:18,003 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:18,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-04 00:57:18,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-04 00:57:18,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 49 conjunts are in the unsatisfiable core [2022-10-04 00:57:18,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-04 00:57:18,564 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-04 00:57:18,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-04 00:57:18,627 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:18,824 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-10-04 00:57:18,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-10-04 00:57:18,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-10-04 00:57:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 434 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:57:21,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-04 00:57:32,538 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:57:32,538 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 158 treesize of output 160 [2022-10-04 00:57:32,840 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-04 00:57:32,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 85 treesize of output 355 [2022-10-04 00:57:34,223 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 234 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-04 00:57:34,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852003987] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-04 00:57:34,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-04 00:57:34,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27, 21] total 71 [2022-10-04 00:57:34,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469607193] [2022-10-04 00:57:34,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-04 00:57:34,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-10-04 00:57:34,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-04 00:57:34,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-10-04 00:57:34,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=4615, Unknown=0, NotChecked=0, Total=4970 [2022-10-04 00:57:34,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:34,226 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-04 00:57:34,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 20.422535211267604) internal successors, (1450), 71 states have internal predecessors, (1450), 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:34,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-04 00:57:34,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-10-04 00:57:34,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-10-04 00:57:34,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2022-10-04 00:57:34,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-10-04 00:57:34,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.