/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleep-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-a47a088281b0b97d17910950432b7c5b5bc3adeb-a47a088 [2021-07-14 03:44:49,044 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-14 03:44:49,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-14 03:44:49,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-14 03:44:49,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-14 03:44:49,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-14 03:44:49,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-14 03:44:49,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-14 03:44:49,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-14 03:44:49,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-14 03:44:49,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-14 03:44:49,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-14 03:44:49,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-14 03:44:49,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-14 03:44:49,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-14 03:44:49,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-14 03:44:49,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-14 03:44:49,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-14 03:44:49,108 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-14 03:44:49,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-14 03:44:49,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-14 03:44:49,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-14 03:44:49,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-14 03:44:49,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-14 03:44:49,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-14 03:44:49,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-14 03:44:49,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-14 03:44:49,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-14 03:44:49,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-14 03:44:49,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-14 03:44:49,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-14 03:44:49,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-14 03:44:49,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-14 03:44:49,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-14 03:44:49,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-14 03:44:49,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-14 03:44:49,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-14 03:44:49,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-14 03:44:49,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-14 03:44:49,157 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-14 03:44:49,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-14 03:44:49,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleep-NoLbe.epf [2021-07-14 03:44:49,186 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-14 03:44:49,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-14 03:44:49,187 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-14 03:44:49,187 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-14 03:44:49,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-14 03:44:49,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-14 03:44:49,190 INFO L138 SettingsManager]: * Use SBE=true [2021-07-14 03:44:49,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-14 03:44:49,190 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-14 03:44:49,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-14 03:44:49,191 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-14 03:44:49,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-14 03:44:49,191 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-14 03:44:49,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-14 03:44:49,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-14 03:44:49,191 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-14 03:44:49,191 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-14 03:44:49,191 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-14 03:44:49,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-14 03:44:49,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-14 03:44:49,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-14 03:44:49,192 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-14 03:44:49,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-14 03:44:49,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-14 03:44:49,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-14 03:44:49,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-14 03:44:49,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-14 03:44:49,193 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-14 03:44:49,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-14 03:44:49,193 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-14 03:44:49,193 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-07-14 03:44:49,193 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-14 03:44:49,193 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2021-07-14 03:44:49,193 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-07-14 03:44:49,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-14 03:44:49,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-14 03:44:49,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-14 03:44:49,465 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-07-14 03:44:49,466 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-07-14 03:44:49,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl [2021-07-14 03:44:49,467 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl' [2021-07-14 03:44:49,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-14 03:44:49,489 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-07-14 03:44:49,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-14 03:44:49,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-14 03:44:49,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-14 03:44:49,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.07 03:44:49" (1/1) ... [2021-07-14 03:44:49,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.07 03:44:49" (1/1) ... [2021-07-14 03:44:49,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-14 03:44:49,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-14 03:44:49,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-14 03:44:49,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-14 03:44:49,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.07 03:44:49" (1/1) ... [2021-07-14 03:44:49,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.07 03:44:49" (1/1) ... [2021-07-14 03:44:49,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.07 03:44:49" (1/1) ... [2021-07-14 03:44:49,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.07 03:44:49" (1/1) ... [2021-07-14 03:44:49,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.07 03:44:49" (1/1) ... [2021-07-14 03:44:49,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.07 03:44:49" (1/1) ... [2021-07-14 03:44:49,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.07 03:44:49" (1/1) ... [2021-07-14 03:44:49,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-14 03:44:49,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-14 03:44:49,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-14 03:44:49,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-14 03:44:49,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.07 03:44:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-14 03:44:49,574 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-07-14 03:44:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-07-14 03:44:49,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-07-14 03:44:49,574 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-07-14 03:44:49,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-07-14 03:44:49,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-07-14 03:44:49,575 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-07-14 03:44:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-14 03:44:49,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-14 03:44:49,575 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-07-14 03:44:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-07-14 03:44:49,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-07-14 03:44:49,575 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-07-14 03:44:49,575 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-07-14 03:44:49,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-07-14 03:44:49,575 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2021-07-14 03:44:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2021-07-14 03:44:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2021-07-14 03:44:49,576 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2021-07-14 03:44:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2021-07-14 03:44:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2021-07-14 03:44:49,577 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-14 03:44:49,759 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-14 03:44:49,759 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-07-14 03:44:49,761 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:44:49 BoogieIcfgContainer [2021-07-14 03:44:49,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-14 03:44:49,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-14 03:44:49,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-14 03:44:49,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-14 03:44:49,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.07 03:44:49" (1/2) ... [2021-07-14 03:44:49,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bee4d3e and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 03:44:49, skipping insertion in model container [2021-07-14 03:44:49,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:44:49" (2/2) ... [2021-07-14 03:44:49,766 INFO L111 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2021-07-14 03:44:49,769 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-14 03:44:49,769 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-14 03:44:49,770 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-07-14 03:44:49,770 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-14 03:44:49,863 INFO L149 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2021-07-14 03:44:49,879 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-07-14 03:44:49,994 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-14 03:44:49,994 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-14 03:44:49,994 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-14 03:44:49,994 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-14 03:44:49,994 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-14 03:44:49,994 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-14 03:44:49,994 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-14 03:44:49,994 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == thread4Thread1of1ForFork3======== [2021-07-14 03:44:50,328 INFO L301 ceAbstractionStarter]: Result for error location thread4Thread1of1ForFork3 was SAFE (1/3) [2021-07-14 03:44:50,332 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-07-14 03:44:50,339 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-14 03:44:50,339 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-14 03:44:50,339 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-14 03:44:50,339 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-14 03:44:50,339 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-14 03:44:50,339 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-14 03:44:50,339 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-14 03:44:50,339 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-07-14 03:44:50,484 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-14 03:44:50,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 03:44:50,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2110288356, now seen corresponding path program 1 times [2021-07-14 03:44:50,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 03:44:50,494 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806685707] [2021-07-14 03:44:50,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 03:44:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 03:44:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2021-07-14 03:44:50,655 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 03:44:50,655 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806685707] [2021-07-14 03:44:50,655 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806685707] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 03:44:50,656 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 03:44:50,656 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-14 03:44:50,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579489036] [2021-07-14 03:44:50,660 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-14 03:44:50,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 03:44:50,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-14 03:44:50,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-14 03:44:50,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-14 03:44:50,670 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-14 03:44:50,670 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2021-07-14 03:44:50,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-14 03:44:50,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:50,908 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-14 03:44:50,908 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-14 03:44:50,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 03:44:50,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1262386875, now seen corresponding path program 2 times [2021-07-14 03:44:50,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 03:44:50,910 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381339341] [2021-07-14 03:44:50,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 03:44:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 03:44:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2021-07-14 03:44:50,973 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 03:44:50,973 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381339341] [2021-07-14 03:44:50,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381339341] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 03:44:50,973 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 03:44:50,973 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-14 03:44:50,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629006643] [2021-07-14 03:44:50,974 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-14 03:44:50,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 03:44:50,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-14 03:44:50,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-14 03:44:50,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-14 03:44:50,975 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-14 03:44:50,976 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) [2021-07-14 03:44:50,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:50,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-14 03:44:51,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,163 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-14 03:44:51,163 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-14 03:44:51,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 03:44:51,164 INFO L82 PathProgramCache]: Analyzing trace with hash 107807872, now seen corresponding path program 3 times [2021-07-14 03:44:51,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 03:44:51,165 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316259713] [2021-07-14 03:44:51,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 03:44:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 03:44:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2021-07-14 03:44:51,207 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 03:44:51,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316259713] [2021-07-14 03:44:51,208 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316259713] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 03:44:51,208 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 03:44:51,208 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-14 03:44:51,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950829205] [2021-07-14 03:44:51,209 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-14 03:44:51,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 03:44:51,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-14 03:44:51,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-14 03:44:51,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-14 03:44:51,212 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-14 03:44:51,212 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) [2021-07-14 03:44:51,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-14 03:44:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,430 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-14 03:44:51,430 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-14 03:44:51,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 03:44:51,432 INFO L82 PathProgramCache]: Analyzing trace with hash -981273509, now seen corresponding path program 4 times [2021-07-14 03:44:51,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 03:44:51,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127105573] [2021-07-14 03:44:51,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 03:44:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 03:44:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2021-07-14 03:44:51,475 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 03:44:51,475 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127105573] [2021-07-14 03:44:51,475 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127105573] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 03:44:51,475 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 03:44:51,475 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-14 03:44:51,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085967898] [2021-07-14 03:44:51,476 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-14 03:44:51,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 03:44:51,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-14 03:44:51,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-14 03:44:51,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-14 03:44:51,476 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-14 03:44:51,477 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2021-07-14 03:44:51,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-14 03:44:51,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,727 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-14 03:44:51,728 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-14 03:44:51,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 03:44:51,728 INFO L82 PathProgramCache]: Analyzing trace with hash -228979652, now seen corresponding path program 5 times [2021-07-14 03:44:51,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 03:44:51,729 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336113292] [2021-07-14 03:44:51,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 03:44:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 03:44:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-07-14 03:44:51,777 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 03:44:51,778 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336113292] [2021-07-14 03:44:51,778 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336113292] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 03:44:51,778 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 03:44:51,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-14 03:44:51,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287477876] [2021-07-14 03:44:51,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-14 03:44:51,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 03:44:51,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-14 03:44:51,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-14 03:44:51,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-14 03:44:51,779 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-14 03:44:51,779 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) [2021-07-14 03:44:51,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-14 03:44:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,935 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-14 03:44:51,935 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-14 03:44:51,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 03:44:51,935 INFO L82 PathProgramCache]: Analyzing trace with hash 96630007, now seen corresponding path program 6 times [2021-07-14 03:44:51,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 03:44:51,936 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693027329] [2021-07-14 03:44:51,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 03:44:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 03:44:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-07-14 03:44:51,980 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 03:44:51,980 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693027329] [2021-07-14 03:44:51,981 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693027329] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 03:44:51,981 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 03:44:51,981 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-14 03:44:51,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524253134] [2021-07-14 03:44:51,981 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-14 03:44:51,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 03:44:51,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-14 03:44:51,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-14 03:44:51,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-14 03:44:51,982 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-14 03:44:51,982 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) [2021-07-14 03:44:51,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:51,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-14 03:44:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:52,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:52,169 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-14 03:44:52,169 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-14 03:44:52,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 03:44:52,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1433443922, now seen corresponding path program 7 times [2021-07-14 03:44:52,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 03:44:52,170 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662065307] [2021-07-14 03:44:52,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 03:44:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 03:44:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 03:44:52,628 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 03:44:52,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662065307] [2021-07-14 03:44:52,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662065307] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-14 03:44:52,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371027487] [2021-07-14 03:44:52,629 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-14 03:44:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 03:44:52,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 37 conjunts are in the unsatisfiable core [2021-07-14 03:44:52,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-14 03:44:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-14 03:44:52,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371027487] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-14 03:44:52,962 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-14 03:44:52,962 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2021-07-14 03:44:52,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916527220] [2021-07-14 03:44:52,962 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-07-14 03:44:52,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 03:44:52,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-07-14 03:44:52,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-07-14 03:44:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-14 03:44:52,963 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-07-14 03:44:52,963 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 14 states have internal predecessors, (55), 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) [2021-07-14 03:44:52,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:52,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:52,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:52,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:52,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:52,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:52,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-07-14 03:44:53,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:53,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:53,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:53,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:53,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:53,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-14 03:44:53,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-14 03:44:53,724 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-14 03:44:53,725 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-14 03:44:53,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 03:44:53,725 INFO L82 PathProgramCache]: Analyzing trace with hash 628947184, now seen corresponding path program 8 times [2021-07-14 03:44:53,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 03:44:53,726 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784595315] [2021-07-14 03:44:53,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 03:44:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-14 03:44:53,736 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-14 03:44:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-14 03:44:53,749 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-14 03:44:53,773 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-14 03:44:53,774 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-14 03:44:53,774 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-14 03:44:53,778 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/3) [2021-07-14 03:44:53,780 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-14 03:44:53,817 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 03:44:53 BasicIcfg [2021-07-14 03:44:53,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-14 03:44:53,818 INFO L168 Benchmark]: Toolchain (without parser) took 4328.95 ms. Allocated memory was 188.7 MB in the beginning and 543.2 MB in the end (delta: 354.4 MB). Free memory was 168.3 MB in the beginning and 422.9 MB in the end (delta: -254.6 MB). Peak memory consumption was 100.9 MB. Max. memory is 8.0 GB. [2021-07-14 03:44:53,818 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.11 ms. Allocated memory is still 188.7 MB. Free memory is still 169.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-14 03:44:53,818 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.14 ms. Allocated memory is still 188.7 MB. Free memory was 168.2 MB in the beginning and 166.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-14 03:44:53,818 INFO L168 Benchmark]: Boogie Preprocessor took 17.20 ms. Allocated memory is still 188.7 MB. Free memory was 166.6 MB in the beginning and 165.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-07-14 03:44:53,818 INFO L168 Benchmark]: RCFGBuilder took 233.60 ms. Allocated memory is still 188.7 MB. Free memory was 165.5 MB in the beginning and 150.1 MB in the end (delta: 15.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-07-14 03:44:53,818 INFO L168 Benchmark]: TraceAbstraction took 4055.14 ms. Allocated memory was 188.7 MB in the beginning and 543.2 MB in the end (delta: 354.4 MB). Free memory was 149.6 MB in the beginning and 422.9 MB in the end (delta: -273.3 MB). Peak memory consumption was 82.1 MB. Max. memory is 8.0 GB. [2021-07-14 03:44:53,818 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.11 ms. Allocated memory is still 188.7 MB. Free memory is still 169.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 19.14 ms. Allocated memory is still 188.7 MB. Free memory was 168.2 MB in the beginning and 166.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 17.20 ms. Allocated memory is still 188.7 MB. Free memory was 166.6 MB in the beginning and 165.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 233.60 ms. Allocated memory is still 188.7 MB. Free memory was 165.5 MB in the beginning and 150.1 MB in the end (delta: 15.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4055.14 ms. Allocated memory was 188.7 MB in the beginning and 543.2 MB in the end (delta: 354.4 MB). Free memory was 149.6 MB in the beginning and 422.9 MB in the end (delta: -273.3 MB). Peak memory consumption was 82.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5737, positive: 5075, positive conditional: 5075, positive unconditional: 0, negative: 662, negative conditional: 662, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 5291, positive: 5075, positive conditional: 5075, positive unconditional: 0, negative: 216, negative conditional: 216, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 5291, positive: 5075, positive conditional: 0, positive unconditional: 5075, negative: 216, negative conditional: 0, negative unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 431, positive: 421, positive conditional: 0, positive unconditional: 421, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 431, positive: 417, positive conditional: 0, positive unconditional: 417, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 81, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5291, positive: 4654, positive conditional: 0, positive unconditional: 4654, negative: 206, negative conditional: 0, negative unconditional: 206, unknown: 431, unknown conditional: 0, unknown unconditional: 431] , Statistics on independence cache: Total cache size (in pairs): 431, Positive cache size: 421, Positive conditional cache size: 0, Positive unconditional cache size: 421, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 ], Maximal queried relation: 0, Independence queries for same thread: 446 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 148730, positive: 134951, positive conditional: 134951, positive unconditional: 0, negative: 13779, negative conditional: 13779, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 137958, positive: 134951, positive conditional: 134951, positive unconditional: 0, negative: 3007, negative conditional: 3007, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 137958, positive: 134834, positive conditional: 0, positive unconditional: 134834, negative: 3124, negative conditional: 0, negative unconditional: 3124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 742, positive: 722, positive conditional: 0, positive unconditional: 722, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 742, positive: 714, positive conditional: 0, positive unconditional: 714, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 26, negative conditional: 6, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 76, positive: 39, positive conditional: 2, positive unconditional: 36, negative: 37, negative conditional: 6, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 137958, positive: 134112, positive conditional: 0, positive unconditional: 134112, negative: 3104, negative conditional: 0, negative unconditional: 3104, unknown: 742, unknown conditional: 0, unknown unconditional: 742] , Statistics on independence cache: Total cache size (in pairs): 750, Positive cache size: 724, Positive conditional cache size: 2, Positive unconditional cache size: 722, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, SemanticConditionEliminator.Independence Queries: [ total: 11089, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 10972, negative conditional: 474, negative unconditional: 10498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11089, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 10972, negative conditional: 474, negative unconditional: 10498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 26, negative conditional: 6, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 76, positive: 39, positive conditional: 2, positive unconditional: 36, negative: 37, negative conditional: 6, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11089, positive: 115, positive conditional: 115, positive unconditional: 0, negative: 10966, negative conditional: 468, negative unconditional: 10498, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 750, Positive cache size: 724, Positive conditional cache size: 2, Positive unconditional cache size: 722, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Eliminated conditions: 10498, SemanticConditionEliminator.Independence Queries: [ total: 11089, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 10972, negative conditional: 474, negative unconditional: 10498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11089, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 10972, negative conditional: 474, negative unconditional: 10498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 26, negative conditional: 6, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 76, positive: 39, positive conditional: 2, positive unconditional: 36, negative: 37, negative conditional: 6, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11089, positive: 115, positive conditional: 115, positive unconditional: 0, negative: 10966, negative conditional: 468, negative unconditional: 10498, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 750, Positive cache size: 724, Positive conditional cache size: 2, Positive unconditional cache size: 722, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Eliminated conditions: 10498, SemanticConditionEliminator.Independence Queries: [ total: 11089, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 10972, negative conditional: 474, negative unconditional: 10498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11089, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 10972, negative conditional: 474, negative unconditional: 10498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 26, negative conditional: 6, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 76, positive: 39, positive conditional: 2, positive unconditional: 36, negative: 37, negative conditional: 6, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11089, positive: 115, positive conditional: 115, positive unconditional: 0, negative: 10966, negative conditional: 468, negative unconditional: 10498, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 750, Positive cache size: 724, Positive conditional cache size: 2, Positive unconditional cache size: 722, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Eliminated conditions: 10498, SemanticConditionEliminator.Independence Queries: [ total: 11089, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 10972, negative conditional: 474, negative unconditional: 10498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11089, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 10972, negative conditional: 474, negative unconditional: 10498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 26, negative conditional: 6, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 76, positive: 39, positive conditional: 2, positive unconditional: 36, negative: 37, negative conditional: 6, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11089, positive: 115, positive conditional: 115, positive unconditional: 0, negative: 10966, negative conditional: 468, negative unconditional: 10498, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 750, Positive cache size: 724, Positive conditional cache size: 2, Positive unconditional cache size: 722, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Eliminated conditions: 10498, SemanticConditionEliminator.Independence Queries: [ total: 11089, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 10972, negative conditional: 474, negative unconditional: 10498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11089, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 10972, negative conditional: 474, negative unconditional: 10498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 26, negative conditional: 6, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 76, positive: 39, positive conditional: 2, positive unconditional: 36, negative: 37, negative conditional: 6, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11089, positive: 115, positive conditional: 115, positive unconditional: 0, negative: 10966, negative conditional: 468, negative unconditional: 10498, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 750, Positive cache size: 724, Positive conditional cache size: 2, Positive unconditional cache size: 722, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Eliminated conditions: 10498, SemanticConditionEliminator.Independence Queries: [ total: 11089, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 10972, negative conditional: 474, negative unconditional: 10498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11089, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 10972, negative conditional: 474, negative unconditional: 10498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 26, negative conditional: 6, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 76, positive: 39, positive conditional: 2, positive unconditional: 36, negative: 37, negative conditional: 6, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11089, positive: 115, positive conditional: 115, positive unconditional: 0, negative: 10966, negative conditional: 468, negative unconditional: 10498, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 750, Positive cache size: 724, Positive conditional cache size: 2, Positive unconditional cache size: 722, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Eliminated conditions: 10498, SemanticConditionEliminator.Independence Queries: [ total: 11089, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 10972, negative conditional: 474, negative unconditional: 10498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11089, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 10972, negative conditional: 474, negative unconditional: 10498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 26, negative conditional: 6, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 76, positive: 39, positive conditional: 2, positive unconditional: 36, negative: 37, negative conditional: 6, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11089, positive: 115, positive conditional: 115, positive unconditional: 0, negative: 10966, negative conditional: 468, negative unconditional: 10498, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 750, Positive cache size: 724, Positive conditional cache size: 2, Positive unconditional cache size: 722, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Eliminated conditions: 10498 ], Maximal queried relation: 7, Independence queries for same thread: 10772 - CounterExampleResult [Line: 121]: assertion can be violated assertion can be violated We found a FailurePath: [L115] 0 assume x_0 == x_8 && y_1 == y_9; VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L116] FORK 0 fork 1 thread1(); VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L117] FORK 0 fork 4, 4, 4, 4 thread4(); VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L60] 1 f1_2 := false; [L61] 1 f2_3 := false; VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L103] 2 f1_10 := false; [L104] 2 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L63] FORK 1 fork 2, 2 thread2(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L30] 3 temp_4 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L31] 3 x_0 := temp_4 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L32] 3 f1_2 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L64] FORK 1 fork 3, 3, 3 thread3(); VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L45] 4 temp_6 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L46] 4 y_1 := temp_6 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L47] 4 f2_3 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L33] 3 assume f2_3; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L34] 3 temp_5 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L35] 3 y_1 := temp_5 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, x_0=0, x_8=-1, y_1=1, y_9=-1] [L48] 4 assume f1_2; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, x_0=0, x_8=-1, y_1=1, y_9=-1] [L36] 3 f1_2 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, x_0=0, x_8=-1, y_1=1, y_9=-1] [L49] 4 temp_7 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=0, x_8=-1, y_1=1, y_9=-1] [L50] 4 x_0 := temp_7 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L51] 4 f2_3 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L37] 3 assume !f2_3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L30] 3 temp_4 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L31] 3 x_0 := temp_4 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=-1, temp_7=0, x_0=2, x_8=-1, y_1=1, y_9=-1] [L52] 4 assume !f1_2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=-1, temp_7=0, x_0=2, x_8=-1, y_1=1, y_9=-1] [L32] 3 f1_2 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=-1, temp_7=0, x_0=2, x_8=-1, y_1=1, y_9=-1] [L45] 4 temp_6 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=1, y_9=-1] [L46] 4 y_1 := temp_6 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=2, y_9=-1] [L47] 4 f2_3 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=1, temp_5=0, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=2, y_9=-1] [L33] 3 assume f2_3; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=1, temp_5=0, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=2, y_9=-1] [L34] 3 temp_5 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=2, y_9=-1] [L35] 3 y_1 := temp_5 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=3, y_9=-1] [L48] 4 assume f1_2; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=3, y_9=-1] [L36] 3 f1_2 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=3, y_9=-1] [L49] 4 temp_7 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=2, x_8=-1, y_1=3, y_9=-1] [L50] 4 x_0 := temp_7 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=-1, y_1=3, y_9=-1] [L51] 4 f2_3 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=-1, y_1=3, y_9=-1] [L37] 3 assume !f2_3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=-1, y_1=3, y_9=-1] [L52] 4 assume !f1_2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=-1, y_1=3, y_9=-1] [L106] FORK 2 fork 5, 5, 5, 5, 5 thread5(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=-1, y_1=3, y_9=-1] [L73] 5 temp_12 := x_8; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=-1, y_1=3, y_9=-1] [L74] 5 x_8 := temp_12 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=-1] [L75] 5 f1_10 := true; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=-1] [L107] FORK 2 fork 6, 6, 6, 6, 6, 6 thread6(); VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=-1] [L88] 6 temp_14 := y_9; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=-1] [L89] 6 y_9 := temp_14 + 1; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=0] [L90] 6 f2_11 := true; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=0] [L76] 5 assume f2_11; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=0] [L77] 5 temp_13 := y_9; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=0] [L78] 5 y_9 := temp_13 + 1; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=1] [L91] 6 assume f1_10; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=1] [L79] 5 f1_10 := false; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=1] [L92] 6 temp_15 := x_8; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=1] [L93] 6 x_8 := temp_15 + 1; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L94] 6 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L80] 5 assume !f2_11; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L95] 6 assume !f1_10; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L65] JOIN 3 join 2, 2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L66] JOIN 4 join 3, 3, 3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L118] JOIN 1 join 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L108] JOIN 5 join 5, 5, 5, 5, 5; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L109] JOIN 6 join 6, 6, 6, 6, 6, 6; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L119] JOIN 2 join 4, 4, 4, 4; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L120] 0 assume !(x_0 == x_8 && y_1 == y_9); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L121] 0 assert false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread4Thread1of1ForFork3 with 1 thread instances CFG has 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 422.9ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 20.3ms, PartialOrderReductionTime: 299.7ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms 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.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3444.6ms, OverallIterations: 8, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.4ms, PartialOrderReductionTime: 1921.2ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 31.8ms SsaConstructionTime, 127.5ms SatisfiabilityAnalysisTime, 952.9ms InterpolantComputationTime, 951 NumberOfCodeBlocks, 951 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 872 ConstructedInterpolants, 0 QuantifiedInterpolants, 2335 SizeOfPredicates, 16 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 1255/1263 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 proved your program to be incorrect! Received shutdown request...