/usr/bin/java -Xmx16000000000 -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-DelaySleep-NoLbe-Random7777.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-07 01:56:06,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-07 01:56:06,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-07 01:56:06,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-07 01:56:06,655 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-07 01:56:06,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-07 01:56:06,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-07 01:56:06,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-07 01:56:06,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-07 01:56:06,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-07 01:56:06,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-07 01:56:06,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-07 01:56:06,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-07 01:56:06,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-07 01:56:06,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-07 01:56:06,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-07 01:56:06,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-07 01:56:06,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-07 01:56:06,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-07 01:56:06,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-07 01:56:06,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-07 01:56:06,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-07 01:56:06,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-07 01:56:06,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-07 01:56:06,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-07 01:56:06,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-07 01:56:06,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-07 01:56:06,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-07 01:56:06,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-07 01:56:06,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-07 01:56:06,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-07 01:56:06,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-07 01:56:06,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-07 01:56:06,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-07 01:56:06,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-07 01:56:06,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-07 01:56:06,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-07 01:56:06,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-07 01:56:06,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-07 01:56:06,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-07 01:56:06,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-07 01:56:06,685 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-DelaySleep-NoLbe-Random7777.epf [2021-06-07 01:56:06,704 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-07 01:56:06,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-07 01:56:06,704 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-07 01:56:06,705 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-07 01:56:06,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-07 01:56:06,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-07 01:56:06,706 INFO L138 SettingsManager]: * Use SBE=true [2021-06-07 01:56:06,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-07 01:56:06,707 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-07 01:56:06,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-07 01:56:06,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-07 01:56:06,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-07 01:56:06,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-07 01:56:06,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-07 01:56:06,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-07 01:56:06,708 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-07 01:56:06,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-07 01:56:06,709 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-07 01:56:06,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-07 01:56:06,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-07 01:56:06,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-07 01:56:06,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-07 01:56:06,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-07 01:56:06,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-07 01:56:06,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-07 01:56:06,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-07 01:56:06,711 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-07 01:56:06,711 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-07 01:56:06,711 INFO L138 SettingsManager]: * DFS Order used in POR=RANDOM [2021-06-07 01:56:06,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-07 01:56:06,711 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-07 01:56:06,712 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-06-07 01:56:06,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-07 01:56:06,712 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-06-07 01:56:06,712 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-07 01:56:06,713 INFO L138 SettingsManager]: * Random seed used by POR DFS order=7777 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-07 01:56:07,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-07 01:56:07,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-07 01:56:07,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-07 01:56:07,050 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-07 01:56:07,052 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-07 01:56:07,053 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-07 01:56:07,053 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2021-06-07 01:56:07,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-07 01:56:07,076 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-07 01:56:07,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-07 01:56:07,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-07 01:56:07,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-07 01:56:07,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.06 01:56:07" (1/1) ... [2021-06-07 01:56:07,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.06 01:56:07" (1/1) ... [2021-06-07 01:56:07,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-07 01:56:07,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-07 01:56:07,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-07 01:56:07,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-07 01:56:07,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.06 01:56:07" (1/1) ... [2021-06-07 01:56:07,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.06 01:56:07" (1/1) ... [2021-06-07 01:56:07,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.06 01:56:07" (1/1) ... [2021-06-07 01:56:07,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.06 01:56:07" (1/1) ... [2021-06-07 01:56:07,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.06 01:56:07" (1/1) ... [2021-06-07 01:56:07,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.06 01:56:07" (1/1) ... [2021-06-07 01:56:07,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.06 01:56:07" (1/1) ... [2021-06-07 01:56:07,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-07 01:56:07,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-07 01:56:07,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-07 01:56:07,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-07 01:56:07,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.06 01:56:07" (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-07 01:56:07,214 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2021-06-07 01:56:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2021-06-07 01:56:07,215 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2021-06-07 01:56:07,215 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2021-06-07 01:56:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2021-06-07 01:56:07,215 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2021-06-07 01:56:07,215 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-07 01:56:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-07 01:56:07,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-07 01:56:07,216 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2021-06-07 01:56:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2021-06-07 01:56:07,217 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2021-06-07 01:56:07,217 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-07 01:56:07,383 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-07 01:56:07,383 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-06-07 01:56:07,384 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.06 01:56:07 BoogieIcfgContainer [2021-06-07 01:56:07,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-07 01:56:07,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-07 01:56:07,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-07 01:56:07,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-07 01:56:07,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.06 01:56:07" (1/2) ... [2021-06-07 01:56:07,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f1f8d2 and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.06 01:56:07, skipping insertion in model container [2021-06-07 01:56:07,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.06 01:56:07" (2/2) ... [2021-06-07 01:56:07,391 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2021-06-07 01:56:07,395 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-07 01:56:07,395 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-07 01:56:07,396 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-07 01:56:07,396 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-07 01:56:07,426 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,426 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,431 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,431 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,432 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,432 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,432 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,432 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,438 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,439 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,439 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,440 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,440 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,440 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,440 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,440 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,446 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,448 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-07 01:56:07,454 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-07 01:56:07,488 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-07 01:56:07,554 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-07 01:56:07,554 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-07 01:56:07,555 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-07 01:56:07,555 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-07 01:56:07,555 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-07 01:56:07,556 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-07 01:56:07,556 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-07 01:56:07,556 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2Thread1of1ForFork2======== [2021-06-07 01:56:07,592 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:07,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:07,597 INFO L82 PathProgramCache]: Analyzing trace with hash -301183993, now seen corresponding path program 1 times [2021-06-07 01:56:07,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:07,604 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853110640] [2021-06-07 01:56:07,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-07 01:56:07,684 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-07 01:56:07,685 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-07 01:56:07,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853110640] [2021-06-07 01:56:07,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853110640] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-07 01:56:07,686 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-07 01:56:07,686 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-07 01:56:07,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819281900] [2021-06-07 01:56:07,690 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-07 01:56:07,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-07 01:56:07,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-07 01:56:07,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-07 01:56:07,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:07,703 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-07 01:56:07,704 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-07 01:56:07,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:07,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:07,761 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-07 01:56:07,761 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:07,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:07,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1012476770, now seen corresponding path program 1 times [2021-06-07 01:56:07,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:07,762 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376693633] [2021-06-07 01:56:07,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-07 01:56:07,795 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-07 01:56:07,795 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-07 01:56:07,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376693633] [2021-06-07 01:56:07,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376693633] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-07 01:56:07,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-07 01:56:07,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-07 01:56:07,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735730852] [2021-06-07 01:56:07,797 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-07 01:56:07,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-07 01:56:07,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-07 01:56:07,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-07 01:56:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:07,798 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-07 01:56:07,799 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-07 01:56:07,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:07,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:07,841 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-07 01:56:07,841 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:07,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:07,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1479565609, now seen corresponding path program 1 times [2021-06-07 01:56:07,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:07,842 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923020331] [2021-06-07 01:56:07,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-07 01:56:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-07 01:56:07,870 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-07 01:56:07,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923020331] [2021-06-07 01:56:07,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923020331] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-07 01:56:07,871 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-07 01:56:07,871 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-07 01:56:07,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450894587] [2021-06-07 01:56:07,872 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-07 01:56:07,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-07 01:56:07,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-07 01:56:07,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-07 01:56:07,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:07,873 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-07 01:56:07,873 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-07 01:56:07,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:07,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:07,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:07,948 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-07 01:56:07,948 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:07,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:07,949 INFO L82 PathProgramCache]: Analyzing trace with hash -753333317, now seen corresponding path program 1 times [2021-06-07 01:56:07,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:07,949 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532320358] [2021-06-07 01:56:07,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-07 01:56:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-07 01:56:07,991 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-07 01:56:07,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532320358] [2021-06-07 01:56:07,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532320358] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-07 01:56:07,992 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-07 01:56:07,992 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-07 01:56:07,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955226035] [2021-06-07 01:56:07,992 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-07 01:56:07,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-07 01:56:07,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-07 01:56:07,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-07 01:56:07,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:07,994 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-07 01:56:07,994 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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-07 01:56:07,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:07,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:07,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:07,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,056 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-07 01:56:08,056 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:08,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:08,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1441209294, now seen corresponding path program 1 times [2021-06-07 01:56:08,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:08,057 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758189149] [2021-06-07 01:56:08,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-07 01:56:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-07 01:56:08,100 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-07 01:56:08,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758189149] [2021-06-07 01:56:08,100 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758189149] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-07 01:56:08,101 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-07 01:56:08,101 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-07 01:56:08,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829262322] [2021-06-07 01:56:08,101 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-07 01:56:08,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-07 01:56:08,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-07 01:56:08,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-07 01:56:08,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,102 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-07 01:56:08,103 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-07 01:56:08,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,207 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-07 01:56:08,207 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:08,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:08,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1500177047, now seen corresponding path program 2 times [2021-06-07 01:56:08,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:08,208 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648619915] [2021-06-07 01:56:08,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-07 01:56:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-07 01:56:08,238 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-07 01:56:08,238 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648619915] [2021-06-07 01:56:08,238 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648619915] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-07 01:56:08,238 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-07 01:56:08,238 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-07 01:56:08,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312425315] [2021-06-07 01:56:08,239 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-07 01:56:08,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-07 01:56:08,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-07 01:56:08,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-07 01:56:08,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,240 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-07 01:56:08,240 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-07 01:56:08,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,315 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-07 01:56:08,315 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:08,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:08,316 INFO L82 PathProgramCache]: Analyzing trace with hash -631112040, now seen corresponding path program 3 times [2021-06-07 01:56:08,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:08,316 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516595041] [2021-06-07 01:56:08,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-07 01:56:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-07 01:56:08,355 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-07 01:56:08,356 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516595041] [2021-06-07 01:56:08,356 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516595041] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-07 01:56:08,356 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-07 01:56:08,356 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-07 01:56:08,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104859082] [2021-06-07 01:56:08,357 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-07 01:56:08,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-07 01:56:08,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-07 01:56:08,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-07 01:56:08,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,358 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-07 01:56:08,358 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-07 01:56:08,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-07 01:56:08,430 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-07 01:56:08,430 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:08,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:08,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1477732624, now seen corresponding path program 1 times [2021-06-07 01:56:08,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:08,431 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455456082] [2021-06-07 01:56:08,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-07 01:56:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-07 01:56:08,466 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-07 01:56:08,467 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455456082] [2021-06-07 01:56:08,467 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455456082] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-07 01:56:08,467 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-07 01:56:08,467 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-07 01:56:08,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854319135] [2021-06-07 01:56:08,468 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-07 01:56:08,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-07 01:56:08,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-07 01:56:08,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-07 01:56:08,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,469 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-07 01:56:08,469 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-07 01:56:08,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-07 01:56:08,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:08,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:08,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-07 01:56:08,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-07 01:56:08,525 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-07 01:56:08,525 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:08,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:08,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1122542337, now seen corresponding path program 2 times [2021-06-07 01:56:08,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:08,526 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861723621] [2021-06-07 01:56:08,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-07 01:56:08,535 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-07 01:56:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-07 01:56:08,542 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-07 01:56:08,558 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-07 01:56:08,558 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-07 01:56:08,559 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-07 01:56:08,566 INFO L301 ceAbstractionStarter]: Result for error location Process2Thread1of1ForFork2 was UNSAFE (1/5) [2021-06-07 01:56:08,569 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-07 01:56:08,584 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-07 01:56:08,584 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-07 01:56:08,585 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-07 01:56:08,585 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-07 01:56:08,585 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-07 01:56:08,585 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-07 01:56:08,585 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-07 01:56:08,585 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2======== [2021-06-07 01:56:08,838 INFO L301 ceAbstractionStarter]: Result for error location Process2 was SAFE (2/5) [2021-06-07 01:56:08,839 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-07 01:56:08,845 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-07 01:56:08,845 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-07 01:56:08,845 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-07 01:56:08,845 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-07 01:56:08,845 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-07 01:56:08,845 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-07 01:56:08,845 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-07 01:56:08,846 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1======== [2021-06-07 01:56:09,024 INFO L301 ceAbstractionStarter]: Result for error location Process1 was SAFE (3/5) [2021-06-07 01:56:09,025 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-06-07 01:56:09,041 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-07 01:56:09,041 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-07 01:56:09,041 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-07 01:56:09,041 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-07 01:56:09,042 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-07 01:56:09,042 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-07 01:56:09,042 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-07 01:56:09,042 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-07 01:56:09,252 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (4/5) [2021-06-07 01:56:09,252 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 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-07 01:56:09,258 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-07 01:56:09,259 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-07 01:56:09,259 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-07 01:56:09,259 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-07 01:56:09,259 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-07 01:56:09,259 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-07 01:56:09,259 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-07 01:56:09,259 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1Thread1of1ForFork1======== [2021-06-07 01:56:09,263 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:09,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:09,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1993337742, now seen corresponding path program 1 times [2021-06-07 01:56:09,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:09,263 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616342221] [2021-06-07 01:56:09,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-07 01:56:09,269 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-07 01:56:09,269 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-07 01:56:09,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616342221] [2021-06-07 01:56:09,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616342221] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-07 01:56:09,269 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-07 01:56:09,269 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-07 01:56:09,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972394742] [2021-06-07 01:56:09,270 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-07 01:56:09,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-07 01:56:09,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-07 01:56:09,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-07 01:56:09,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,270 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-07 01:56:09,270 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-07 01:56:09,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,271 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-07 01:56:09,272 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:09,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:09,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1128325677, now seen corresponding path program 1 times [2021-06-07 01:56:09,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:09,272 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364503029] [2021-06-07 01:56:09,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-07 01:56:09,280 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-07 01:56:09,280 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-07 01:56:09,280 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364503029] [2021-06-07 01:56:09,281 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364503029] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-07 01:56:09,281 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-07 01:56:09,281 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-07 01:56:09,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84563880] [2021-06-07 01:56:09,281 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-07 01:56:09,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-07 01:56:09,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-07 01:56:09,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-07 01:56:09,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,282 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-07 01:56:09,282 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-07 01:56:09,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,386 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-07 01:56:09,386 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:09,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:09,387 INFO L82 PathProgramCache]: Analyzing trace with hash -859369141, now seen corresponding path program 1 times [2021-06-07 01:56:09,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:09,387 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489543500] [2021-06-07 01:56:09,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-07 01:56:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-07 01:56:09,399 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-07 01:56:09,399 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489543500] [2021-06-07 01:56:09,399 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489543500] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-07 01:56:09,399 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-07 01:56:09,399 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-07 01:56:09,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125364340] [2021-06-07 01:56:09,399 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-07 01:56:09,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-07 01:56:09,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-07 01:56:09,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-07 01:56:09,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,400 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-07 01:56:09,400 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-07 01:56:09,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,441 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-07 01:56:09,441 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:09,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:09,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1475983102, now seen corresponding path program 1 times [2021-06-07 01:56:09,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:09,442 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807567531] [2021-06-07 01:56:09,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-07 01:56:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-07 01:56:09,511 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-07 01:56:09,511 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807567531] [2021-06-07 01:56:09,511 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807567531] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-07 01:56:09,511 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-07 01:56:09,511 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-07 01:56:09,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091479640] [2021-06-07 01:56:09,512 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-07 01:56:09,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-07 01:56:09,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-07 01:56:09,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-07 01:56:09,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,513 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-07 01:56:09,513 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-07 01:56:09,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,557 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-07 01:56:09,557 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:09,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:09,558 INFO L82 PathProgramCache]: Analyzing trace with hash -146290387, now seen corresponding path program 2 times [2021-06-07 01:56:09,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:09,558 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537149732] [2021-06-07 01:56:09,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-07 01:56:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-06-07 01:56:09,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-07 01:56:09,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537149732] [2021-06-07 01:56:09,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537149732] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-07 01:56:09,582 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-07 01:56:09,582 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-07 01:56:09,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339561789] [2021-06-07 01:56:09,583 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-07 01:56:09,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-07 01:56:09,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-07 01:56:09,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-07 01:56:09,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,584 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-07 01:56:09,584 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-07 01:56:09,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,621 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-07 01:56:09,622 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:09,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:09,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1500161191, now seen corresponding path program 3 times [2021-06-07 01:56:09,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:09,622 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355033950] [2021-06-07 01:56:09,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-07 01:56:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-07 01:56:09,656 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-07 01:56:09,656 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355033950] [2021-06-07 01:56:09,656 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355033950] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-07 01:56:09,656 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-07 01:56:09,657 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-07 01:56:09,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883567830] [2021-06-07 01:56:09,657 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-07 01:56:09,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-07 01:56:09,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-07 01:56:09,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-07 01:56:09,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,658 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-07 01:56:09,658 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-07 01:56:09,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,692 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-07 01:56:09,692 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:09,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:09,694 INFO L82 PathProgramCache]: Analyzing trace with hash -432944412, now seen corresponding path program 4 times [2021-06-07 01:56:09,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:09,694 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331785219] [2021-06-07 01:56:09,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-07 01:56:09,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-07 01:56:09,733 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-07 01:56:09,733 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331785219] [2021-06-07 01:56:09,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331785219] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-07 01:56:09,734 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-07 01:56:09,734 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-07 01:56:09,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26268389] [2021-06-07 01:56:09,737 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-07 01:56:09,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-07 01:56:09,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-07 01:56:09,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-07 01:56:09,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,737 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-07 01:56:09,738 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-07 01:56:09,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-07 01:56:09,796 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-07 01:56:09,796 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:09,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:09,797 INFO L82 PathProgramCache]: Analyzing trace with hash 884627968, now seen corresponding path program 1 times [2021-06-07 01:56:09,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:09,797 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311835461] [2021-06-07 01:56:09,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-07 01:56:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-07 01:56:09,824 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-07 01:56:09,824 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311835461] [2021-06-07 01:56:09,824 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311835461] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-07 01:56:09,824 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-07 01:56:09,824 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-07 01:56:09,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652621814] [2021-06-07 01:56:09,824 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-07 01:56:09,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-07 01:56:09,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-07 01:56:09,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-07 01:56:09,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,825 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-07 01:56:09,825 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-07 01:56:09,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-07 01:56:09,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-07 01:56:09,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-07 01:56:09,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-07 01:56:09,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-07 01:56:09,875 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-07 01:56:09,875 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-07 01:56:09,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-07 01:56:09,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1239818255, now seen corresponding path program 2 times [2021-06-07 01:56:09,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-07 01:56:09,876 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765900334] [2021-06-07 01:56:09,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-07 01:56:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-07 01:56:09,882 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-07 01:56:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-07 01:56:09,890 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-07 01:56:09,895 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-07 01:56:09,895 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-07 01:56:09,896 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-07 01:56:09,900 INFO L301 ceAbstractionStarter]: Result for error location Process1Thread1of1ForFork1 was UNSAFE (5/5) [2021-06-07 01:56:09,900 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-07 01:56:09,941 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.06 01:56:09 BasicIcfg [2021-06-07 01:56:09,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-07 01:56:09,943 INFO L168 Benchmark]: Toolchain (without parser) took 2866.57 ms. Allocated memory is still 362.8 MB. Free memory was 341.8 MB in the beginning and 247.4 MB in the end (delta: 94.4 MB). Peak memory consumption was 93.8 MB. Max. memory is 16.0 GB. [2021-06-07 01:56:09,944 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 ms. Allocated memory is still 362.8 MB. Free memory was 342.9 MB in the beginning and 342.8 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-07 01:56:09,945 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.37 ms. Allocated memory is still 362.8 MB. Free memory was 341.7 MB in the beginning and 340.3 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-07 01:56:09,945 INFO L168 Benchmark]: Boogie Preprocessor took 19.28 ms. Allocated memory is still 362.8 MB. Free memory was 340.3 MB in the beginning and 339.3 MB in the end (delta: 999.2 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-07 01:56:09,945 INFO L168 Benchmark]: RCFGBuilder took 258.65 ms. Allocated memory is still 362.8 MB. Free memory was 339.2 MB in the beginning and 326.7 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. [2021-06-07 01:56:09,946 INFO L168 Benchmark]: TraceAbstraction took 2555.72 ms. Allocated memory is still 362.8 MB. Free memory was 326.2 MB in the beginning and 247.4 MB in the end (delta: 78.8 MB). Peak memory consumption was 79.1 MB. Max. memory is 16.0 GB. [2021-06-07 01:56:09,949 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.14 ms. Allocated memory is still 362.8 MB. Free memory was 342.9 MB in the beginning and 342.8 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 27.37 ms. Allocated memory is still 362.8 MB. Free memory was 341.7 MB in the beginning and 340.3 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 19.28 ms. Allocated memory is still 362.8 MB. Free memory was 340.3 MB in the beginning and 339.3 MB in the end (delta: 999.2 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 258.65 ms. Allocated memory is still 362.8 MB. Free memory was 339.2 MB in the beginning and 326.7 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 2555.72 ms. Allocated memory is still 362.8 MB. Free memory was 326.2 MB in the beginning and 247.4 MB in the end (delta: 78.8 MB). Peak memory consumption was 79.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5686, positive: 4448, positive conditional: 4448, positive unconditional: 0, negative: 1238, negative conditional: 1238, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 4879, positive: 4448, positive conditional: 4448, positive unconditional: 0, negative: 431, negative conditional: 431, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 4879, positive: 4437, positive conditional: 0, positive unconditional: 4437, negative: 442, negative conditional: 0, negative unconditional: 442, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 392, positive: 367, positive conditional: 0, positive unconditional: 367, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 392, positive: 352, positive conditional: 0, positive unconditional: 352, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 18, positive conditional: 3, positive unconditional: 15, negative: 50, negative conditional: 25, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, positive: 40, positive conditional: 8, positive unconditional: 32, negative: 126, negative conditional: 47, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4879, positive: 4070, positive conditional: 0, positive unconditional: 4070, negative: 417, negative conditional: 0, negative unconditional: 417, unknown: 392, unknown conditional: 0, unknown unconditional: 392] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 370, Positive conditional cache size: 3, Positive unconditional cache size: 367, Negative cache size: 50, Negative conditional cache size: 25, Negative unconditional cache size: 25, SemanticConditionEliminator.Independence Queries: [ total: 2566, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2555, negative conditional: 138, negative unconditional: 2417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2566, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2555, negative conditional: 138, negative unconditional: 2417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 18, positive conditional: 3, positive unconditional: 15, negative: 50, negative conditional: 25, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, positive: 40, positive conditional: 8, positive unconditional: 32, negative: 126, negative conditional: 47, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2566, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 2530, negative conditional: 113, negative unconditional: 2417, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 370, Positive conditional cache size: 3, Positive unconditional cache size: 367, Negative cache size: 50, Negative conditional cache size: 25, Negative unconditional cache size: 25, Eliminated conditions: 2417, SemanticConditionEliminator.Independence Queries: [ total: 2566, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2555, negative conditional: 138, negative unconditional: 2417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2566, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2555, negative conditional: 138, negative unconditional: 2417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 18, positive conditional: 3, positive unconditional: 15, negative: 50, negative conditional: 25, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, positive: 40, positive conditional: 8, positive unconditional: 32, negative: 126, negative conditional: 47, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2566, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 2530, negative conditional: 113, negative unconditional: 2417, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 370, Positive conditional cache size: 3, Positive unconditional cache size: 367, Negative cache size: 50, Negative conditional cache size: 25, Negative unconditional cache size: 25, Eliminated conditions: 2417, SemanticConditionEliminator.Independence Queries: [ total: 2566, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2555, negative conditional: 138, negative unconditional: 2417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2566, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2555, negative conditional: 138, negative unconditional: 2417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 18, positive conditional: 3, positive unconditional: 15, negative: 50, negative conditional: 25, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, positive: 40, positive conditional: 8, positive unconditional: 32, negative: 126, negative conditional: 47, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2566, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 2530, negative conditional: 113, negative unconditional: 2417, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 370, Positive conditional cache size: 3, Positive unconditional cache size: 367, Negative cache size: 50, Negative conditional cache size: 25, Negative unconditional cache size: 25, Eliminated conditions: 2417, SemanticConditionEliminator.Independence Queries: [ total: 2566, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2555, negative conditional: 138, negative unconditional: 2417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2566, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2555, negative conditional: 138, negative unconditional: 2417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 18, positive conditional: 3, positive unconditional: 15, negative: 50, negative conditional: 25, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, positive: 40, positive conditional: 8, positive unconditional: 32, negative: 126, negative conditional: 47, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2566, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 2530, negative conditional: 113, negative unconditional: 2417, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 370, Positive conditional cache size: 3, Positive unconditional cache size: 367, Negative cache size: 50, Negative conditional cache size: 25, Negative unconditional cache size: 25, Eliminated conditions: 2417, SemanticConditionEliminator.Independence Queries: [ total: 2566, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2555, negative conditional: 138, negative unconditional: 2417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2566, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2555, negative conditional: 138, negative unconditional: 2417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 18, positive conditional: 3, positive unconditional: 15, negative: 50, negative conditional: 25, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, positive: 40, positive conditional: 8, positive unconditional: 32, negative: 126, negative conditional: 47, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2566, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 2530, negative conditional: 113, negative unconditional: 2417, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 370, Positive conditional cache size: 3, Positive unconditional cache size: 367, Negative cache size: 50, Negative conditional cache size: 25, Negative unconditional cache size: 25, Eliminated conditions: 2417, SemanticConditionEliminator.Independence Queries: [ total: 2566, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2555, negative conditional: 138, negative unconditional: 2417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2566, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2555, negative conditional: 138, negative unconditional: 2417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 18, positive conditional: 3, positive unconditional: 15, negative: 50, negative conditional: 25, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, positive: 40, positive conditional: 8, positive unconditional: 32, negative: 126, negative conditional: 47, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2566, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 2530, negative conditional: 113, negative unconditional: 2417, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 370, Positive conditional cache size: 3, Positive unconditional cache size: 367, Negative cache size: 50, Negative conditional cache size: 25, Negative unconditional cache size: 25, Eliminated conditions: 2417, SemanticConditionEliminator.Independence Queries: [ total: 2566, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2555, negative conditional: 138, negative unconditional: 2417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2566, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2555, negative conditional: 138, negative unconditional: 2417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 18, positive conditional: 3, positive unconditional: 15, negative: 50, negative conditional: 25, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, positive: 40, positive conditional: 8, positive unconditional: 32, negative: 126, negative conditional: 47, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2566, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 2530, negative conditional: 113, negative unconditional: 2417, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 370, Positive conditional cache size: 3, Positive unconditional cache size: 367, Negative cache size: 50, Negative conditional cache size: 25, Negative unconditional cache size: 25, Eliminated conditions: 2417, SemanticConditionEliminator.Independence Queries: [ total: 2566, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2555, negative conditional: 138, negative unconditional: 2417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2566, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2555, negative conditional: 138, negative unconditional: 2417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 18, positive conditional: 3, positive unconditional: 15, negative: 50, negative conditional: 25, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, positive: 40, positive conditional: 8, positive unconditional: 32, negative: 126, negative conditional: 47, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2566, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 2530, negative conditional: 113, negative unconditional: 2417, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 370, Positive conditional cache size: 3, Positive unconditional cache size: 367, Negative cache size: 50, Negative conditional cache size: 25, Negative unconditional cache size: 25, Eliminated conditions: 2417 ], Maximal queried relation: 8, Independence queries for same thread: 807 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7211, positive: 5942, positive conditional: 5942, positive unconditional: 0, negative: 1269, negative conditional: 1269, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 6261, positive: 5942, positive conditional: 5942, positive unconditional: 0, negative: 319, negative conditional: 319, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 6261, positive: 5942, positive conditional: 0, positive unconditional: 5942, negative: 319, negative conditional: 0, negative unconditional: 319, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 549, positive: 515, positive conditional: 0, positive unconditional: 515, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 549, positive: 496, positive conditional: 0, positive unconditional: 496, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 53, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 111, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6261, positive: 5427, positive conditional: 0, positive unconditional: 5427, negative: 285, negative conditional: 0, negative unconditional: 285, unknown: 549, unknown conditional: 0, unknown unconditional: 549] , Statistics on independence cache: Total cache size (in pairs): 549, Positive cache size: 515, Positive conditional cache size: 0, Positive unconditional cache size: 515, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 ], Maximal queried relation: 0, Independence queries for same thread: 950 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7211, positive: 5942, positive conditional: 5942, positive unconditional: 0, negative: 1269, negative conditional: 1269, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 6261, positive: 5942, positive conditional: 5942, positive unconditional: 0, negative: 319, negative conditional: 319, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 6261, positive: 5942, positive conditional: 0, positive unconditional: 5942, negative: 319, negative conditional: 0, negative unconditional: 319, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 549, positive: 515, positive conditional: 0, positive unconditional: 515, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 549, positive: 496, positive conditional: 0, positive unconditional: 496, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 53, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6261, positive: 5427, positive conditional: 0, positive unconditional: 5427, negative: 285, negative conditional: 0, negative unconditional: 285, unknown: 549, unknown conditional: 0, unknown unconditional: 549] , Statistics on independence cache: Total cache size (in pairs): 549, Positive cache size: 515, Positive conditional cache size: 0, Positive unconditional cache size: 515, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 ], Maximal queried relation: 0, Independence queries for same thread: 950 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7211, positive: 5942, positive conditional: 5942, positive unconditional: 0, negative: 1269, negative conditional: 1269, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 6261, positive: 5942, positive conditional: 5942, positive unconditional: 0, negative: 319, negative conditional: 319, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 6261, positive: 5942, positive conditional: 0, positive unconditional: 5942, negative: 319, negative conditional: 0, negative unconditional: 319, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 549, positive: 515, positive conditional: 0, positive unconditional: 515, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 549, positive: 496, positive conditional: 0, positive unconditional: 496, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 53, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6261, positive: 5427, positive conditional: 0, positive unconditional: 5427, negative: 285, negative conditional: 0, negative unconditional: 285, unknown: 549, unknown conditional: 0, unknown unconditional: 549] , Statistics on independence cache: Total cache size (in pairs): 549, Positive cache size: 515, Positive conditional cache size: 0, Positive unconditional cache size: 515, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 ], Maximal queried relation: 0, Independence queries for same thread: 950 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9502, positive: 7406, positive conditional: 7406, positive unconditional: 0, negative: 2096, negative conditional: 2096, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 8151, positive: 7406, positive conditional: 7406, positive unconditional: 0, negative: 745, negative conditional: 745, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 8151, positive: 7380, positive conditional: 0, positive unconditional: 7380, negative: 771, negative conditional: 0, negative unconditional: 771, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 515, positive: 477, positive conditional: 0, positive unconditional: 477, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 515, positive: 453, positive conditional: 0, positive unconditional: 453, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, positive: 29, positive conditional: 5, positive unconditional: 24, negative: 68, negative conditional: 30, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, positive: 18, positive conditional: 4, positive unconditional: 15, negative: 95, negative conditional: 31, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8151, positive: 6903, positive conditional: 0, positive unconditional: 6903, negative: 733, negative conditional: 0, negative unconditional: 733, unknown: 515, unknown conditional: 0, unknown unconditional: 515] , Statistics on independence cache: Total cache size (in pairs): 550, Positive cache size: 482, Positive conditional cache size: 5, Positive unconditional cache size: 477, Negative cache size: 68, Negative conditional cache size: 30, Negative unconditional cache size: 38, SemanticConditionEliminator.Independence Queries: [ total: 3944, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 3918, negative conditional: 177, negative unconditional: 3741, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3944, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 3918, negative conditional: 177, negative unconditional: 3741, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, positive: 29, positive conditional: 5, positive unconditional: 24, negative: 68, negative conditional: 30, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, positive: 18, positive conditional: 4, positive unconditional: 15, negative: 95, negative conditional: 31, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3944, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 3888, negative conditional: 147, negative unconditional: 3741, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 550, Positive cache size: 482, Positive conditional cache size: 5, Positive unconditional cache size: 477, Negative cache size: 68, Negative conditional cache size: 30, Negative unconditional cache size: 38, Eliminated conditions: 3741, SemanticConditionEliminator.Independence Queries: [ total: 3944, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 3918, negative conditional: 177, negative unconditional: 3741, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3944, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 3918, negative conditional: 177, negative unconditional: 3741, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, positive: 29, positive conditional: 5, positive unconditional: 24, negative: 68, negative conditional: 30, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, positive: 18, positive conditional: 4, positive unconditional: 15, negative: 95, negative conditional: 31, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3944, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 3888, negative conditional: 147, negative unconditional: 3741, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 550, Positive cache size: 482, Positive conditional cache size: 5, Positive unconditional cache size: 477, Negative cache size: 68, Negative conditional cache size: 30, Negative unconditional cache size: 38, Eliminated conditions: 3741, SemanticConditionEliminator.Independence Queries: [ total: 3944, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 3918, negative conditional: 177, negative unconditional: 3741, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3944, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 3918, negative conditional: 177, negative unconditional: 3741, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, positive: 29, positive conditional: 5, positive unconditional: 24, negative: 68, negative conditional: 30, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, positive: 18, positive conditional: 4, positive unconditional: 15, negative: 95, negative conditional: 31, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3944, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 3888, negative conditional: 147, negative unconditional: 3741, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 550, Positive cache size: 482, Positive conditional cache size: 5, Positive unconditional cache size: 477, Negative cache size: 68, Negative conditional cache size: 30, Negative unconditional cache size: 38, Eliminated conditions: 3741, SemanticConditionEliminator.Independence Queries: [ total: 3944, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 3918, negative conditional: 177, negative unconditional: 3741, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3944, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 3918, negative conditional: 177, negative unconditional: 3741, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, positive: 29, positive conditional: 5, positive unconditional: 24, negative: 68, negative conditional: 30, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, positive: 18, positive conditional: 4, positive unconditional: 15, negative: 95, negative conditional: 31, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3944, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 3888, negative conditional: 147, negative unconditional: 3741, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 550, Positive cache size: 482, Positive conditional cache size: 5, Positive unconditional cache size: 477, Negative cache size: 68, Negative conditional cache size: 30, Negative unconditional cache size: 38, Eliminated conditions: 3741, SemanticConditionEliminator.Independence Queries: [ total: 3944, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 3918, negative conditional: 177, negative unconditional: 3741, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3944, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 3918, negative conditional: 177, negative unconditional: 3741, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, positive: 29, positive conditional: 5, positive unconditional: 24, negative: 68, negative conditional: 30, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, positive: 18, positive conditional: 4, positive unconditional: 15, negative: 95, negative conditional: 31, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3944, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 3888, negative conditional: 147, negative unconditional: 3741, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 550, Positive cache size: 482, Positive conditional cache size: 5, Positive unconditional cache size: 477, Negative cache size: 68, Negative conditional cache size: 30, Negative unconditional cache size: 38, Eliminated conditions: 3741, SemanticConditionEliminator.Independence Queries: [ total: 3944, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 3918, negative conditional: 177, negative unconditional: 3741, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3944, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 3918, negative conditional: 177, negative unconditional: 3741, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, positive: 29, positive conditional: 5, positive unconditional: 24, negative: 68, negative conditional: 30, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, positive: 18, positive conditional: 4, positive unconditional: 15, negative: 95, negative conditional: 31, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3944, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 3888, negative conditional: 147, negative unconditional: 3741, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 550, Positive cache size: 482, Positive conditional cache size: 5, Positive unconditional cache size: 477, Negative cache size: 68, Negative conditional cache size: 30, Negative unconditional cache size: 38, Eliminated conditions: 3741, SemanticConditionEliminator.Independence Queries: [ total: 3944, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 3918, negative conditional: 177, negative unconditional: 3741, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3944, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 3918, negative conditional: 177, negative unconditional: 3741, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, positive: 29, positive conditional: 5, positive unconditional: 24, negative: 68, negative conditional: 30, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, positive: 18, positive conditional: 4, positive unconditional: 15, negative: 95, negative conditional: 31, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3944, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 3888, negative conditional: 147, negative unconditional: 3741, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 550, Positive cache size: 482, Positive conditional cache size: 5, Positive unconditional cache size: 477, Negative cache size: 68, Negative conditional cache size: 30, Negative unconditional cache size: 38, Eliminated conditions: 3741, SemanticConditionEliminator.Independence Queries: [ total: 3944, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 3918, negative conditional: 177, negative unconditional: 3741, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3944, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 3918, negative conditional: 177, negative unconditional: 3741, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, positive: 29, positive conditional: 5, positive unconditional: 24, negative: 68, negative conditional: 30, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, positive: 18, positive conditional: 4, positive unconditional: 15, negative: 95, negative conditional: 31, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3944, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 3888, negative conditional: 147, negative unconditional: 3741, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 550, Positive cache size: 482, Positive conditional cache size: 5, Positive unconditional cache size: 477, Negative cache size: 68, Negative conditional cache size: 30, Negative unconditional cache size: 38, Eliminated conditions: 3741 ], Maximal queried relation: 8, Independence queries for same thread: 1351 - 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 FALSE 2 !(lock != 1) VAL [clk=0, critical=0, delay=1, lock=1, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=0, critical=0, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=0, critical=0, delay=1, lock=1, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=0, critical=0, delay=1, lock=1, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=0, critical=1, deadline=1, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L87] 3 assert critical == 0; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L88] 3 critical := 2; VAL [clk=1, critical=2, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=1, critical=2, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L89] 3 critical := 0; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=2, critical=1, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=2, critical=1, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=2, critical=1, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=2, critical=1, deadline=2, deadline=3, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=2, critical=1, deadline=2, deadline=3, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=2, critical=1, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=2, critical=1, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=2, critical=1, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=1, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=3, critical=1, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=3, critical=1, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=3, critical=1, deadline=2, deadline=3, 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 FALSE 2 !(lock != 1) VAL [clk=0, critical=0, delay=1, lock=1, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=0, critical=0, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=0, critical=0, delay=1, lock=1, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=0, critical=0, delay=1, lock=1, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=0, critical=1, deadline=1, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L87] 3 assert critical == 0; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L88] 3 critical := 2; VAL [clk=1, critical=2, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=1, critical=2, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L89] 3 critical := 0; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=3, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=3, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=3, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=3, critical=2, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=3, critical=2, deadline=2, deadline=3, 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: 1060.8ms, OverallIterations: 9, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16.2ms, PartialOrderReductionTime: 555.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 25, 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: 14.2ms SsaConstructionTime, 78.6ms SatisfiabilityAnalysisTime, 185.3ms InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 269 ConstructedInterpolants, 0 QuantifiedInterpolants, 425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 59/59 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: 268.0ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.5ms, PartialOrderReductionTime: 250.3ms, 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: 183.0ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.0ms, PartialOrderReductionTime: 172.4ms, 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: 226.3ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.8ms, PartialOrderReductionTime: 208.4ms, 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: 646.9ms, OverallIterations: 9, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.8ms, PartialOrderReductionTime: 368.5ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 25, 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: 9.1ms SsaConstructionTime, 69.9ms SatisfiabilityAnalysisTime, 130.3ms InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 439 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 133/133 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...