/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-NewStatesSleepPersistentFixedOrder-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-14 15:25:15,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-14 15:25:15,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-14 15:25:15,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-14 15:25:15,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-14 15:25:15,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-14 15:25:15,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-14 15:25:15,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-14 15:25:15,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-14 15:25:15,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-14 15:25:15,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-14 15:25:15,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-14 15:25:15,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-14 15:25:15,323 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-14 15:25:15,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-14 15:25:15,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-14 15:25:15,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-14 15:25:15,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-14 15:25:15,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-14 15:25:15,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-14 15:25:15,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-14 15:25:15,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-14 15:25:15,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-14 15:25:15,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-14 15:25:15,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-14 15:25:15,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-14 15:25:15,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-14 15:25:15,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-14 15:25:15,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-14 15:25:15,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-14 15:25:15,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-14 15:25:15,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-14 15:25:15,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-14 15:25:15,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-14 15:25:15,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-14 15:25:15,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-14 15:25:15,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-14 15:25:15,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-14 15:25:15,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-14 15:25:15,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-14 15:25:15,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-14 15:25:15,369 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-NewStatesSleepPersistentFixedOrder-NoLbe.epf [2021-06-14 15:25:15,388 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-14 15:25:15,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-14 15:25:15,389 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-14 15:25:15,389 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-14 15:25:15,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-14 15:25:15,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-14 15:25:15,390 INFO L138 SettingsManager]: * Use SBE=true [2021-06-14 15:25:15,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-14 15:25:15,390 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-14 15:25:15,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-14 15:25:15,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-14 15:25:15,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-14 15:25:15,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-14 15:25:15,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-14 15:25:15,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-14 15:25:15,391 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-14 15:25:15,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-14 15:25:15,391 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-14 15:25:15,391 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-14 15:25:15,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-14 15:25:15,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-14 15:25:15,391 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-14 15:25:15,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-14 15:25:15,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-14 15:25:15,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-14 15:25:15,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-14 15:25:15,392 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-14 15:25:15,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-14 15:25:15,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-14 15:25:15,392 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-14 15:25:15,392 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-06-14 15:25:15,392 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-14 15:25:15,393 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2021-06-14 15:25:15,393 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-06-14 15:25:15,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-14 15:25:15,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-14 15:25:15,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-14 15:25:15,639 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-14 15:25:15,640 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-14 15:25:15,641 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl [2021-06-14 15:25:15,641 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2021-06-14 15:25:15,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-14 15:25:15,670 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-14 15:25:15,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-14 15:25:15,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-14 15:25:15,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-14 15:25:15,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:25:15" (1/1) ... [2021-06-14 15:25:15,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:25:15" (1/1) ... [2021-06-14 15:25:15,687 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-14 15:25:15,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-14 15:25:15,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-14 15:25:15,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-14 15:25:15,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:25:15" (1/1) ... [2021-06-14 15:25:15,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:25:15" (1/1) ... [2021-06-14 15:25:15,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:25:15" (1/1) ... [2021-06-14 15:25:15,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:25:15" (1/1) ... [2021-06-14 15:25:15,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:25:15" (1/1) ... [2021-06-14 15:25:15,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:25:15" (1/1) ... [2021-06-14 15:25:15,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:25:15" (1/1) ... [2021-06-14 15:25:15,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-14 15:25:15,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-14 15:25:15,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-14 15:25:15,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-14 15:25:15,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:25:15" (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-06-14 15:25:15,805 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2021-06-14 15:25:15,805 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2021-06-14 15:25:15,805 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2021-06-14 15:25:15,805 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2021-06-14 15:25:15,805 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2021-06-14 15:25:15,806 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2021-06-14 15:25:15,806 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-14 15:25:15,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-14 15:25:15,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-14 15:25:15,806 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2021-06-14 15:25:15,806 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2021-06-14 15:25:15,806 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2021-06-14 15:25:15,807 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-14 15:25:15,964 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-14 15:25:15,964 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-06-14 15:25:15,965 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:25:15 BoogieIcfgContainer [2021-06-14 15:25:15,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-14 15:25:15,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-14 15:25:15,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-14 15:25:15,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-14 15:25:15,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:25:15" (1/2) ... [2021-06-14 15:25:15,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fe9988 and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:25:15, skipping insertion in model container [2021-06-14 15:25:15,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:25:15" (2/2) ... [2021-06-14 15:25:15,970 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2021-06-14 15:25:15,974 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-14 15:25:15,974 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-14 15:25:15,975 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-14 15:25:15,975 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-14 15:25:16,006 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,007 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,007 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,007 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,008 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,008 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,008 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,008 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,009 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,009 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,010 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,010 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,010 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,010 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,010 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,011 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,014 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,016 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 15:25:16,016 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-14 15:25:16,030 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 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-06-14 15:25:16,070 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-14 15:25:16,070 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-14 15:25:16,070 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-14 15:25:16,070 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-14 15:25:16,070 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-14 15:25:16,070 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-14 15:25:16,071 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-14 15:25:16,071 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2Thread1of1ForFork2======== [2021-06-14 15:25:16,187 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:16,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:16,191 INFO L82 PathProgramCache]: Analyzing trace with hash 326055189, now seen corresponding path program 1 times [2021-06-14 15:25:16,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:16,212 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151602826] [2021-06-14 15:25:16,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-14 15:25:16,280 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:16,280 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151602826] [2021-06-14 15:25:16,280 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151602826] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 15:25:16,281 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 15:25:16,281 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-14 15:25:16,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831758528] [2021-06-14 15:25:16,284 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-14 15:25:16,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:16,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-14 15:25:16,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-14 15:25:16,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:16,293 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:16,295 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-06-14 15:25:16,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:16,362 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-14 15:25:16,362 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:16,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:16,363 INFO L82 PathProgramCache]: Analyzing trace with hash 550866052, now seen corresponding path program 1 times [2021-06-14 15:25:16,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:16,363 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712415979] [2021-06-14 15:25:16,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-14 15:25:16,414 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:16,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712415979] [2021-06-14 15:25:16,414 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712415979] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 15:25:16,414 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 15:25:16,414 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-14 15:25:16,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184550539] [2021-06-14 15:25:16,415 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 15:25:16,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:16,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 15:25:16,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 15:25:16,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:16,416 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:16,417 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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-06-14 15:25:16,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:16,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:16,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:16,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:16,593 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-14 15:25:16,593 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:16,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:16,595 INFO L82 PathProgramCache]: Analyzing trace with hash 309937240, now seen corresponding path program 1 times [2021-06-14 15:25:16,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:16,596 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545927565] [2021-06-14 15:25:16,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 282 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2021-06-14 15:25:16,728 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:16,729 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545927565] [2021-06-14 15:25:16,729 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545927565] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 15:25:16,729 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 15:25:16,729 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 15:25:16,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482533413] [2021-06-14 15:25:16,730 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 15:25:16,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:16,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 15:25:16,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 15:25:16,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:16,730 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:16,731 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-06-14 15:25:16,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:16,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:16,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:16,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:16,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:16,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:16,840 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-14 15:25:16,840 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:16,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:16,841 INFO L82 PathProgramCache]: Analyzing trace with hash -650515293, now seen corresponding path program 1 times [2021-06-14 15:25:16,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:16,841 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192817442] [2021-06-14 15:25:16,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2021-06-14 15:25:16,898 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:16,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192817442] [2021-06-14 15:25:16,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192817442] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 15:25:16,899 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 15:25:16,899 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 15:25:16,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561015147] [2021-06-14 15:25:16,899 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 15:25:16,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:16,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 15:25:16,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 15:25:16,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:16,900 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:16,900 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-06-14 15:25:16,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:16,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:16,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:16,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,029 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-14 15:25:17,029 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:17,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:17,029 INFO L82 PathProgramCache]: Analyzing trace with hash -539564084, now seen corresponding path program 2 times [2021-06-14 15:25:17,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:17,030 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146886993] [2021-06-14 15:25:17,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:17,087 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-14 15:25:17,087 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:17,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146886993] [2021-06-14 15:25:17,088 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146886993] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 15:25:17,088 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 15:25:17,088 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 15:25:17,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837410862] [2021-06-14 15:25:17,088 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 15:25:17,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:17,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 15:25:17,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 15:25:17,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,089 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:17,089 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-06-14 15:25:17,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,168 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-14 15:25:17,168 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:17,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:17,169 INFO L82 PathProgramCache]: Analyzing trace with hash -274070698, now seen corresponding path program 2 times [2021-06-14 15:25:17,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:17,169 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128770429] [2021-06-14 15:25:17,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-06-14 15:25:17,213 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:17,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128770429] [2021-06-14 15:25:17,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128770429] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 15:25:17,214 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 15:25:17,214 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 15:25:17,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995969962] [2021-06-14 15:25:17,215 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 15:25:17,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:17,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 15:25:17,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 15:25:17,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,220 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:17,220 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-06-14 15:25:17,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,292 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-14 15:25:17,292 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:17,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:17,292 INFO L82 PathProgramCache]: Analyzing trace with hash -250395749, now seen corresponding path program 3 times [2021-06-14 15:25:17,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:17,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492871995] [2021-06-14 15:25:17,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-06-14 15:25:17,341 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:17,341 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492871995] [2021-06-14 15:25:17,341 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492871995] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 15:25:17,341 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 15:25:17,341 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-14 15:25:17,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321298646] [2021-06-14 15:25:17,341 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-14 15:25:17,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:17,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-14 15:25:17,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-14 15:25:17,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,342 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:17,342 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-06-14 15:25:17,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:17,505 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-14 15:25:17,505 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:17,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:17,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1737341300, now seen corresponding path program 4 times [2021-06-14 15:25:17,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:17,507 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291719239] [2021-06-14 15:25:17,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-06-14 15:25:17,543 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:17,544 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291719239] [2021-06-14 15:25:17,544 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291719239] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 15:25:17,544 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 15:25:17,545 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-14 15:25:17,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325834741] [2021-06-14 15:25:17,548 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-14 15:25:17,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:17,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-14 15:25:17,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-14 15:25:17,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,549 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:17,549 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-06-14 15:25:17,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:17,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:17,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:17,658 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-14 15:25:17,658 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:17,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:17,659 INFO L82 PathProgramCache]: Analyzing trace with hash 731591881, now seen corresponding path program 5 times [2021-06-14 15:25:17,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:17,659 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184504239] [2021-06-14 15:25:17,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-14 15:25:17,677 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:17,678 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184504239] [2021-06-14 15:25:17,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184504239] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 15:25:17,678 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 15:25:17,678 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 15:25:17,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728522107] [2021-06-14 15:25:17,680 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 15:25:17,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:17,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 15:25:17,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 15:25:17,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,680 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:17,680 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-06-14 15:25:17,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:17,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:17,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:17,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:17,805 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-14 15:25:17,805 INFO L430 AbstractCegarLoop]: === Iteration 10 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:17,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:17,805 INFO L82 PathProgramCache]: Analyzing trace with hash -418272513, now seen corresponding path program 6 times [2021-06-14 15:25:17,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:17,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160825958] [2021-06-14 15:25:17,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 62 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-14 15:25:17,864 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:17,864 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160825958] [2021-06-14 15:25:17,864 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160825958] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 15:25:17,864 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701248762] [2021-06-14 15:25:17,864 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 15:25:17,926 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-14 15:25:17,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 15:25:17,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-14 15:25:17,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 15:25:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-06-14 15:25:18,172 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701248762] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 15:25:18,172 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 15:25:18,172 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2021-06-14 15:25:18,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356214860] [2021-06-14 15:25:18,174 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-14 15:25:18,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:18,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-14 15:25:18,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-14 15:25:18,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:18,175 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:18,175 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 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-06-14 15:25:18,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:18,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:18,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:18,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:18,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:18,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:18,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:18,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:18,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:18,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:18,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-14 15:25:18,941 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-06-14 15:25:18,941 INFO L430 AbstractCegarLoop]: === Iteration 11 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:18,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:18,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2030975541, now seen corresponding path program 7 times [2021-06-14 15:25:18,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:18,942 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736812887] [2021-06-14 15:25:18,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-14 15:25:18,959 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-14 15:25:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-14 15:25:18,974 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-14 15:25:18,990 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-14 15:25:18,990 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-14 15:25:18,991 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-14 15:25:19,000 INFO L301 ceAbstractionStarter]: Result for error location Process2Thread1of1ForFork2 was UNSAFE (1/5) [2021-06-14 15:25:19,003 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-14 15:25:19,007 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-14 15:25:19,007 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-14 15:25:19,007 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-14 15:25:19,007 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-14 15:25:19,007 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-14 15:25:19,007 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-14 15:25:19,007 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-14 15:25:19,007 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2======== [2021-06-14 15:25:19,079 INFO L301 ceAbstractionStarter]: Result for error location Process2 was SAFE (2/5) [2021-06-14 15:25:19,080 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-06-14 15:25:19,095 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-14 15:25:19,096 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-14 15:25:19,096 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-14 15:25:19,096 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-14 15:25:19,096 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-14 15:25:19,096 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-14 15:25:19,096 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-14 15:25:19,096 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1======== Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-14 15:25:19,153 INFO L301 ceAbstractionStarter]: Result for error location Process1 was SAFE (3/5) [2021-06-14 15:25:19,153 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-14 15:25:19,157 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-14 15:25:19,157 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-14 15:25:19,157 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-14 15:25:19,157 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-14 15:25:19,157 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-14 15:25:19,157 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-14 15:25:19,157 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-14 15:25:19,157 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-14 15:25:19,216 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (4/5) [2021-06-14 15:25:19,216 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-06-14 15:25:19,229 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-14 15:25:19,230 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-14 15:25:19,230 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-14 15:25:19,230 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-14 15:25:19,230 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-14 15:25:19,230 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-14 15:25:19,230 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-14 15:25:19,230 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1Thread1of1ForFork1======== Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-14 15:25:19,264 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:19,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:19,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1986709147, now seen corresponding path program 1 times [2021-06-14 15:25:19,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:19,264 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411498046] [2021-06-14 15:25:19,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-14 15:25:19,270 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:19,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411498046] [2021-06-14 15:25:19,271 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411498046] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 15:25:19,271 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 15:25:19,271 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-14 15:25:19,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794844647] [2021-06-14 15:25:19,271 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-14 15:25:19,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:19,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-14 15:25:19,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-14 15:25:19,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,272 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:19,272 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-06-14 15:25:19,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,278 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-14 15:25:19,278 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:19,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:19,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1309413604, now seen corresponding path program 1 times [2021-06-14 15:25:19,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:19,278 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106427622] [2021-06-14 15:25:19,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-14 15:25:19,286 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:19,286 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106427622] [2021-06-14 15:25:19,286 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106427622] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 15:25:19,286 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 15:25:19,286 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-14 15:25:19,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377363023] [2021-06-14 15:25:19,287 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 15:25:19,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:19,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 15:25:19,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 15:25:19,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,287 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:19,287 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-06-14 15:25:19,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,375 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-14 15:25:19,376 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:19,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:19,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1273138009, now seen corresponding path program 1 times [2021-06-14 15:25:19,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:19,376 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495370885] [2021-06-14 15:25:19,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2021-06-14 15:25:19,401 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:19,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495370885] [2021-06-14 15:25:19,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495370885] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 15:25:19,401 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 15:25:19,401 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 15:25:19,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402230566] [2021-06-14 15:25:19,402 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 15:25:19,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:19,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 15:25:19,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 15:25:19,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,402 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:19,402 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-06-14 15:25:19,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,459 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-14 15:25:19,459 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:19,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:19,459 INFO L82 PathProgramCache]: Analyzing trace with hash -349652305, now seen corresponding path program 1 times [2021-06-14 15:25:19,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:19,459 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151695397] [2021-06-14 15:25:19,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2021-06-14 15:25:19,478 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:19,479 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151695397] [2021-06-14 15:25:19,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151695397] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 15:25:19,479 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 15:25:19,479 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 15:25:19,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624201364] [2021-06-14 15:25:19,479 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 15:25:19,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:19,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 15:25:19,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 15:25:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,480 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:19,480 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-06-14 15:25:19,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,534 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-14 15:25:19,534 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:19,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:19,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1122987757, now seen corresponding path program 2 times [2021-06-14 15:25:19,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:19,535 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589518221] [2021-06-14 15:25:19,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-14 15:25:19,551 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:19,552 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589518221] [2021-06-14 15:25:19,552 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589518221] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 15:25:19,552 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 15:25:19,552 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 15:25:19,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499878588] [2021-06-14 15:25:19,552 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 15:25:19,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:19,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 15:25:19,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 15:25:19,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,553 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:19,553 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-06-14 15:25:19,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,620 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-14 15:25:19,620 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:19,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:19,621 INFO L82 PathProgramCache]: Analyzing trace with hash 582325919, now seen corresponding path program 2 times [2021-06-14 15:25:19,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:19,621 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857871190] [2021-06-14 15:25:19,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-06-14 15:25:19,634 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:19,634 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857871190] [2021-06-14 15:25:19,634 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857871190] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 15:25:19,634 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 15:25:19,634 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-14 15:25:19,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414910060] [2021-06-14 15:25:19,634 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-14 15:25:19,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:19,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-14 15:25:19,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-14 15:25:19,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,635 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:19,635 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-06-14 15:25:19,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:19,694 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-14 15:25:19,694 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:19,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:19,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1871952769, now seen corresponding path program 3 times [2021-06-14 15:25:19,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:19,695 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202873900] [2021-06-14 15:25:19,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-06-14 15:25:19,711 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:19,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202873900] [2021-06-14 15:25:19,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202873900] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 15:25:19,711 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 15:25:19,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-14 15:25:19,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703534552] [2021-06-14 15:25:19,711 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-14 15:25:19,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:19,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-14 15:25:19,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-14 15:25:19,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,714 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:19,715 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-14 15:25:19,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:19,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:19,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:19,832 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-14 15:25:19,832 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:19,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:19,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1067953762, now seen corresponding path program 4 times [2021-06-14 15:25:19,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:19,832 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413068021] [2021-06-14 15:25:19,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:19,849 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-06-14 15:25:19,849 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:19,849 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413068021] [2021-06-14 15:25:19,849 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413068021] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 15:25:19,849 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 15:25:19,849 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 15:25:19,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236350263] [2021-06-14 15:25:19,850 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 15:25:19,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:19,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 15:25:19,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 15:25:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,850 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:19,850 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-06-14 15:25:19,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:19,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:19,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:19,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:19,924 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-14 15:25:19,924 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:19,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:19,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1425213936, now seen corresponding path program 5 times [2021-06-14 15:25:19,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:19,924 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589781235] [2021-06-14 15:25:19,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 15:25:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 70 proven. 26 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-14 15:25:19,973 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 15:25:19,973 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589781235] [2021-06-14 15:25:19,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589781235] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 15:25:19,973 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322700609] [2021-06-14 15:25:19,973 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 15:25:20,011 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-06-14 15:25:20,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 15:25:20,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-14 15:25:20,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 15:25:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 76 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-06-14 15:25:20,175 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322700609] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 15:25:20,175 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 15:25:20,175 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-14 15:25:20,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550964064] [2021-06-14 15:25:20,176 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-14 15:25:20,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 15:25:20,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-14 15:25:20,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-06-14 15:25:20,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:20,177 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 15:25:20,177 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 8.4) internal successors, (126), 15 states have internal predecessors, (126), 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-06-14 15:25:20,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:20,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:20,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:20,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:20,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:20,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:20,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:20,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:20,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:21,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 15:25:21,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:21,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:21,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:21,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:21,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:21,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 15:25:21,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 15:25:21,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-14 15:25:21,420 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 15:25:21,423 INFO L430 AbstractCegarLoop]: === Iteration 10 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 15:25:21,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 15:25:21,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1125706795, now seen corresponding path program 6 times [2021-06-14 15:25:21,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 15:25:21,423 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995429712] [2021-06-14 15:25:21,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 15:25:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-14 15:25:21,437 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-14 15:25:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-14 15:25:21,444 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-14 15:25:21,454 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-14 15:25:21,454 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-14 15:25:21,454 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-14 15:25:21,460 INFO L301 ceAbstractionStarter]: Result for error location Process1Thread1of1ForFork1 was UNSAFE (5/5) [2021-06-14 15:25:21,460 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-14 15:25:21,511 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.06 03:25:21 BasicIcfg [2021-06-14 15:25:21,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-14 15:25:21,512 INFO L168 Benchmark]: Toolchain (without parser) took 5842.20 ms. Allocated memory was 210.8 MB in the beginning and 402.7 MB in the end (delta: 191.9 MB). Free memory was 190.1 MB in the beginning and 319.3 MB in the end (delta: -129.2 MB). Peak memory consumption was 63.8 MB. Max. memory is 8.0 GB. [2021-06-14 15:25:21,512 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.11 ms. Allocated memory is still 210.8 MB. Free memory was 191.3 MB in the beginning and 191.2 MB in the end (delta: 88.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-06-14 15:25:21,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.16 ms. Allocated memory is still 210.8 MB. Free memory was 190.1 MB in the beginning and 188.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-06-14 15:25:21,512 INFO L168 Benchmark]: Boogie Preprocessor took 15.49 ms. Allocated memory is still 210.8 MB. Free memory was 188.6 MB in the beginning and 187.7 MB in the end (delta: 922.8 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-06-14 15:25:21,512 INFO L168 Benchmark]: RCFGBuilder took 260.87 ms. Allocated memory is still 210.8 MB. Free memory was 187.6 MB in the beginning and 175.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-06-14 15:25:21,513 INFO L168 Benchmark]: TraceAbstraction took 5545.34 ms. Allocated memory was 210.8 MB in the beginning and 402.7 MB in the end (delta: 191.9 MB). Free memory was 174.6 MB in the beginning and 319.3 MB in the end (delta: -144.7 MB). Peak memory consumption was 48.1 MB. Max. memory is 8.0 GB. [2021-06-14 15:25:21,513 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 210.8 MB. Free memory was 191.3 MB in the beginning and 191.2 MB in the end (delta: 88.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 17.16 ms. Allocated memory is still 210.8 MB. Free memory was 190.1 MB in the beginning and 188.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 15.49 ms. Allocated memory is still 210.8 MB. Free memory was 188.6 MB in the beginning and 187.7 MB in the end (delta: 922.8 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 260.87 ms. Allocated memory is still 210.8 MB. Free memory was 187.6 MB in the beginning and 175.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5545.34 ms. Allocated memory was 210.8 MB in the beginning and 402.7 MB in the end (delta: 191.9 MB). Free memory was 174.6 MB in the beginning and 319.3 MB in the end (delta: -144.7 MB). Peak memory consumption was 48.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: 27517, positive: 20605, positive conditional: 19346, positive unconditional: 1259, negative: 6912, negative conditional: 6844, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 22952, positive: 20605, positive conditional: 19346, positive unconditional: 1259, negative: 2347, negative conditional: 2279, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 22952, positive: 20491, positive conditional: 0, positive unconditional: 20491, negative: 2461, negative conditional: 0, negative unconditional: 2461, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 876, positive: 835, positive conditional: 0, positive unconditional: 835, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 876, positive: 809, positive conditional: 0, positive unconditional: 809, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22952, positive: 19656, positive conditional: 0, positive unconditional: 19656, negative: 2420, negative conditional: 0, negative unconditional: 2420, unknown: 876, unknown conditional: 0, unknown unconditional: 876] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843 ], Maximal queried relation: 10, Independence queries for same thread: 4565 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 591, Number of persistent set computation: 9642, Number of trivial persistent sets: 8134, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 27517, positive: 20605, positive conditional: 19346, positive unconditional: 1259, negative: 6912, negative conditional: 6844, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 22952, positive: 20605, positive conditional: 19346, positive unconditional: 1259, negative: 2347, negative conditional: 2279, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 22952, positive: 20491, positive conditional: 0, positive unconditional: 20491, negative: 2461, negative conditional: 0, negative unconditional: 2461, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 876, positive: 835, positive conditional: 0, positive unconditional: 835, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 876, positive: 809, positive conditional: 0, positive unconditional: 809, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22952, positive: 19656, positive conditional: 0, positive unconditional: 19656, negative: 2420, negative conditional: 0, negative unconditional: 2420, unknown: 876, unknown conditional: 0, unknown unconditional: 876] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843, SemanticConditionEliminator.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16743, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 16629, negative conditional: 1661, negative unconditional: 14968, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 124, negative conditional: 83, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 271, positive: 65, positive conditional: 34, positive unconditional: 31, negative: 206, negative conditional: 105, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16743, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 16546, negative conditional: 1578, negative unconditional: 14968, unknown: 100, unknown conditional: 100, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 852, Positive conditional cache size: 17, Positive unconditional cache size: 835, Negative cache size: 124, Negative conditional cache size: 83, Negative unconditional cache size: 41, Eliminated conditions: 14843 ], Maximal queried relation: 10, Independence queries for same thread: 4565 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1602, positive: 1406, positive conditional: 686, positive unconditional: 720, negative: 196, negative conditional: 170, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 1447, positive: 1406, positive conditional: 686, positive unconditional: 720, negative: 41, negative conditional: 15, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 1447, positive: 1406, positive conditional: 0, positive unconditional: 1406, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 610, positive: 594, positive conditional: 0, positive unconditional: 594, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 610, positive: 587, positive conditional: 0, positive unconditional: 587, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 23, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1447, positive: 812, positive conditional: 0, positive unconditional: 812, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 610, unknown conditional: 0, unknown unconditional: 610] , Statistics on independence cache: Total cache size (in pairs): 610, Positive cache size: 594, Positive conditional cache size: 0, Positive unconditional cache size: 594, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 ], Maximal queried relation: 0, Independence queries for same thread: 155 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 65, Number of persistent set computation: 241, Number of trivial persistent sets: 182, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1602, positive: 1406, positive conditional: 686, positive unconditional: 720, negative: 196, negative conditional: 170, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 1447, positive: 1406, positive conditional: 686, positive unconditional: 720, negative: 41, negative conditional: 15, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 1447, positive: 1406, positive conditional: 0, positive unconditional: 1406, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 610, positive: 594, positive conditional: 0, positive unconditional: 594, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 610, positive: 587, positive conditional: 0, positive unconditional: 587, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 23, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1447, positive: 812, positive conditional: 0, positive unconditional: 812, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 610, unknown conditional: 0, unknown unconditional: 610] , Statistics on independence cache: Total cache size (in pairs): 610, Positive cache size: 594, Positive conditional cache size: 0, Positive unconditional cache size: 594, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 ], Maximal queried relation: 0, Independence queries for same thread: 155 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1602, positive: 1406, positive conditional: 686, positive unconditional: 720, negative: 196, negative conditional: 170, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 1447, positive: 1406, positive conditional: 686, positive unconditional: 720, negative: 41, negative conditional: 15, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 1447, positive: 1406, positive conditional: 0, positive unconditional: 1406, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 610, positive: 594, positive conditional: 0, positive unconditional: 594, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 610, positive: 587, positive conditional: 0, positive unconditional: 587, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 23, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1447, positive: 812, positive conditional: 0, positive unconditional: 812, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 610, unknown conditional: 0, unknown unconditional: 610] , Statistics on independence cache: Total cache size (in pairs): 610, Positive cache size: 594, Positive conditional cache size: 0, Positive unconditional cache size: 594, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 ], Maximal queried relation: 0, Independence queries for same thread: 155 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 51, Number of persistent set computation: 241, Number of trivial persistent sets: 182, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1602, positive: 1406, positive conditional: 686, positive unconditional: 720, negative: 196, negative conditional: 170, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 1447, positive: 1406, positive conditional: 686, positive unconditional: 720, negative: 41, negative conditional: 15, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 1447, positive: 1406, positive conditional: 0, positive unconditional: 1406, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 610, positive: 594, positive conditional: 0, positive unconditional: 594, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 610, positive: 587, positive conditional: 0, positive unconditional: 587, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 23, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1447, positive: 812, positive conditional: 0, positive unconditional: 812, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 610, unknown conditional: 0, unknown unconditional: 610] , Statistics on independence cache: Total cache size (in pairs): 610, Positive cache size: 594, Positive conditional cache size: 0, Positive unconditional cache size: 594, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 ], Maximal queried relation: 0, Independence queries for same thread: 155 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2215, positive: 1894, positive conditional: 1141, positive unconditional: 753, negative: 321, negative conditional: 294, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 1939, positive: 1894, positive conditional: 1141, positive unconditional: 753, negative: 45, negative conditional: 18, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 1939, positive: 1894, positive conditional: 0, positive unconditional: 1894, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 656, positive: 639, positive conditional: 0, positive unconditional: 639, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 656, positive: 632, positive conditional: 0, positive unconditional: 632, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 24, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1939, positive: 1255, positive conditional: 0, positive unconditional: 1255, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 656, unknown conditional: 0, unknown unconditional: 656] , Statistics on independence cache: Total cache size (in pairs): 656, Positive cache size: 639, Positive conditional cache size: 0, Positive unconditional cache size: 639, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 ], Maximal queried relation: 0, Independence queries for same thread: 276 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 48, Number of persistent set computation: 476, Number of trivial persistent sets: 387, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2215, positive: 1894, positive conditional: 1141, positive unconditional: 753, negative: 321, negative conditional: 294, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 1939, positive: 1894, positive conditional: 1141, positive unconditional: 753, negative: 45, negative conditional: 18, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 1939, positive: 1894, positive conditional: 0, positive unconditional: 1894, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 656, positive: 639, positive conditional: 0, positive unconditional: 639, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 656, positive: 632, positive conditional: 0, positive unconditional: 632, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 24, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1939, positive: 1255, positive conditional: 0, positive unconditional: 1255, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 656, unknown conditional: 0, unknown unconditional: 656] , Statistics on independence cache: Total cache size (in pairs): 656, Positive cache size: 639, Positive conditional cache size: 0, Positive unconditional cache size: 639, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 ], Maximal queried relation: 0, Independence queries for same thread: 276 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26173, positive: 19504, positive conditional: 18306, positive unconditional: 1198, negative: 6669, negative conditional: 6600, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 21711, positive: 19504, positive conditional: 18306, positive unconditional: 1198, negative: 2207, negative conditional: 2138, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 21711, positive: 19426, positive conditional: 0, positive unconditional: 19426, negative: 2285, negative conditional: 0, negative unconditional: 2285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 874, positive: 832, positive conditional: 0, positive unconditional: 832, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 874, positive: 806, positive conditional: 0, positive unconditional: 806, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21711, positive: 18594, positive conditional: 0, positive unconditional: 18594, negative: 2243, negative conditional: 0, negative unconditional: 2243, unknown: 874, unknown conditional: 0, unknown unconditional: 874] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041 ], Maximal queried relation: 9, Independence queries for same thread: 4462 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 319, Number of persistent set computation: 9544, Number of trivial persistent sets: 8215, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 26173, positive: 19504, positive conditional: 18306, positive unconditional: 1198, negative: 6669, negative conditional: 6600, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 21711, positive: 19504, positive conditional: 18306, positive unconditional: 1198, negative: 2207, negative conditional: 2138, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 21711, positive: 19426, positive conditional: 0, positive unconditional: 19426, negative: 2285, negative conditional: 0, negative unconditional: 2285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 874, positive: 832, positive conditional: 0, positive unconditional: 832, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 874, positive: 806, positive conditional: 0, positive unconditional: 806, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21711, positive: 18594, positive conditional: 0, positive unconditional: 18594, negative: 2243, negative conditional: 0, negative unconditional: 2243, unknown: 874, unknown conditional: 0, unknown unconditional: 874] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041, SemanticConditionEliminator.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15405, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15327, negative conditional: 2157, negative unconditional: 13170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 205, positive: 40, positive conditional: 14, positive unconditional: 26, negative: 165, negative conditional: 123, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 21, positive conditional: 8, positive unconditional: 13, negative: 168, negative conditional: 100, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15405, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15204, negative conditional: 2034, negative unconditional: 13170, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 846, Positive conditional cache size: 14, Positive unconditional cache size: 832, Negative cache size: 165, Negative conditional cache size: 123, Negative unconditional cache size: 42, Eliminated conditions: 13041 ], Maximal queried relation: 9, Independence queries for same thread: 4462 - CounterExampleResult [Line: 87]: assertion can be violated assertion can be violated We found a FailurePath: [L28] 0 critical := 0; VAL [critical=0] [L29] 0 clk := 0; VAL [clk=0, critical=0] [L30] 0 assume wait >= 1; VAL [clk=0, critical=0, wait=1] [L33] 0 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK 0 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK 0 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=1, critical=1, deadline=1, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=3, critical=1, deadline=2, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=5, critical=2, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=6, critical=2, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=6, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=7, critical=1, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=8, critical=2, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L69] 2 lock := 0; VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=9, critical=2, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=9, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=0, wait=1] [L66] 2 assert critical == 0; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=0, wait=1] [L67] 2 critical := 1; VAL [clk=10, critical=1, deadline=10, deadline=9, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=11, critical=1, deadline=10, deadline=9, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=11, critical=1, deadline=10, deadline=12, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=11, critical=1, deadline=10, deadline=12, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=11, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=11, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=11, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=12, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=12, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=12, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=12, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] - CounterExampleResult [Line: 66]: assertion can be violated assertion can be violated We found a FailurePath: [L28] 0 critical := 0; VAL [critical=0] [L29] 0 clk := 0; VAL [clk=0, critical=0] [L30] 0 assume wait >= 1; VAL [clk=0, critical=0, wait=1] [L33] 0 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK 0 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK 0 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=1, critical=1, deadline=1, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=3, critical=1, deadline=2, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=5, critical=2, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=6, critical=2, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=6, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=7, critical=1, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=8, critical=2, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L69] 2 lock := 0; VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=9, critical=2, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=9, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=10, critical=0, deadline=10, deadline=11, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=10, critical=0, deadline=10, deadline=11, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=10, critical=0, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=10, critical=0, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=11, critical=0, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=11, critical=0, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=12, critical=0, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=12, critical=0, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=12, critical=0, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=12, critical=0, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=12, critical=2, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=12, critical=2, deadline=10, deadline=12, delay=1, lock=2, wait=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process2Thread1of1ForFork2 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2960.2ms, OverallIterations: 11, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.8ms, PartialOrderReductionTime: 1676.4ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 48, 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: 33.7ms SsaConstructionTime, 200.5ms SatisfiabilityAnalysisTime, 574.9ms InterpolantComputationTime, 1240 NumberOfCodeBlocks, 1240 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1106 ConstructedInterpolants, 0 QuantifiedInterpolants, 1518 SizeOfPredicates, 4 NumberOfNonLiveVariables, 146 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 2184/2200 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process2 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 76.0ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.7ms, PartialOrderReductionTime: 70.5ms, 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: Process1 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 72.1ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.7ms, PartialOrderReductionTime: 55.6ms, 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 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 62.0ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.6ms, PartialOrderReductionTime: 57.2ms, 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: Process1Thread1of1ForFork1 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2243.3ms, OverallIterations: 10, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.5ms, PartialOrderReductionTime: 1577.1ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 59, 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: 12.6ms SsaConstructionTime, 54.5ms SatisfiabilityAnalysisTime, 288.9ms InterpolantComputationTime, 1116 NumberOfCodeBlocks, 1116 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 983 ConstructedInterpolants, 0 QuantifiedInterpolants, 1663 SizeOfPredicates, 4 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 1866/1918 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...