/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleep-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-13 15:03:19,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-13 15:03:19,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-13 15:03:19,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-13 15:03:19,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-13 15:03:19,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-13 15:03:19,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-13 15:03:19,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-13 15:03:19,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-13 15:03:19,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-13 15:03:19,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-13 15:03:19,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-13 15:03:19,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-13 15:03:19,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-13 15:03:19,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-13 15:03:19,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-13 15:03:19,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-13 15:03:19,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-13 15:03:19,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-13 15:03:19,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-13 15:03:19,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-13 15:03:19,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-13 15:03:19,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-13 15:03:19,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-13 15:03:19,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-13 15:03:19,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-13 15:03:19,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-13 15:03:19,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-13 15:03:19,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-13 15:03:19,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-13 15:03:19,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-13 15:03:19,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-13 15:03:19,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-13 15:03:19,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-13 15:03:19,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-13 15:03:19,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-13 15:03:19,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-13 15:03:19,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-13 15:03:19,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-13 15:03:19,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-13 15:03:19,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-13 15:03:19,743 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleep-NoLbe.epf [2021-06-13 15:03:19,777 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-13 15:03:19,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-13 15:03:19,777 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-13 15:03:19,777 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-13 15:03:19,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-13 15:03:19,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-13 15:03:19,780 INFO L138 SettingsManager]: * Use SBE=true [2021-06-13 15:03:19,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-13 15:03:19,780 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-13 15:03:19,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-13 15:03:19,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-13 15:03:19,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-13 15:03:19,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-13 15:03:19,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-13 15:03:19,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-13 15:03:19,782 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-13 15:03:19,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-13 15:03:19,782 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-13 15:03:19,782 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-13 15:03:19,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-13 15:03:19,782 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-13 15:03:19,783 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-13 15:03:19,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-13 15:03:19,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-13 15:03:19,783 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-13 15:03:19,783 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-13 15:03:19,783 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-13 15:03:19,783 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-13 15:03:19,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-13 15:03:19,784 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-13 15:03:19,784 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-06-13 15:03:19,784 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-13 15:03:19,784 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2021-06-13 15:03:19,784 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-13 15:03:20,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-13 15:03:20,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-13 15:03:20,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-13 15:03:20,105 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-13 15:03:20,106 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-13 15:03:20,107 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-13 15:03:20,107 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2021-06-13 15:03:20,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-13 15:03:20,135 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-13 15:03:20,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-13 15:03:20,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-13 15:03:20,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-13 15:03:20,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.06 03:03:20" (1/1) ... [2021-06-13 15:03:20,159 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.06 03:03:20" (1/1) ... [2021-06-13 15:03:20,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-13 15:03:20,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-13 15:03:20,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-13 15:03:20,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-13 15:03:20,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.06 03:03:20" (1/1) ... [2021-06-13 15:03:20,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.06 03:03:20" (1/1) ... [2021-06-13 15:03:20,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.06 03:03:20" (1/1) ... [2021-06-13 15:03:20,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.06 03:03:20" (1/1) ... [2021-06-13 15:03:20,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.06 03:03:20" (1/1) ... [2021-06-13 15:03:20,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.06 03:03:20" (1/1) ... [2021-06-13 15:03:20,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.06 03:03:20" (1/1) ... [2021-06-13 15:03:20,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-13 15:03:20,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-13 15:03:20,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-13 15:03:20,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-13 15:03:20,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.06 03:03:20" (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-13 15:03:20,242 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2021-06-13 15:03:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2021-06-13 15:03:20,242 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2021-06-13 15:03:20,242 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2021-06-13 15:03:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2021-06-13 15:03:20,242 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2021-06-13 15:03:20,242 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-13 15:03:20,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-13 15:03:20,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-13 15:03:20,244 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2021-06-13 15:03:20,244 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2021-06-13 15:03:20,244 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2021-06-13 15:03:20,245 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-13 15:03:20,415 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-13 15:03:20,415 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-06-13 15:03:20,417 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.06 03:03:20 BoogieIcfgContainer [2021-06-13 15:03:20,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-13 15:03:20,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-13 15:03:20,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-13 15:03:20,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-13 15:03:20,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.06 03:03:20" (1/2) ... [2021-06-13 15:03:20,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d0ac4b and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.06 03:03:20, skipping insertion in model container [2021-06-13 15:03:20,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.06 03:03:20" (2/2) ... [2021-06-13 15:03:20,423 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2021-06-13 15:03:20,427 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-13 15:03:20,427 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-13 15:03:20,428 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-13 15:03:20,428 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-13 15:03:20,450 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,450 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,451 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,451 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,452 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,452 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,452 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,452 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,454 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,454 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,455 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,455 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,455 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,455 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,456 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,456 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,461 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,463 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 15:03:20,464 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-13 15:03:20,481 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-13 15:03:20,578 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 15:03:20,578 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 15:03:20,578 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 15:03:20,578 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 15:03:20,579 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 15:03:20,579 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 15:03:20,579 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 15:03:20,579 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2Thread1of1ForFork2======== [2021-06-13 15:03:20,622 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:20,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:20,634 INFO L82 PathProgramCache]: Analyzing trace with hash 326055189, now seen corresponding path program 1 times [2021-06-13 15:03:20,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:20,642 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072618498] [2021-06-13 15:03:20,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:20,774 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-13 15:03:20,774 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:20,775 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072618498] [2021-06-13 15:03:20,775 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072618498] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 15:03:20,776 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 15:03:20,776 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-13 15:03:20,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080996815] [2021-06-13 15:03:20,780 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-13 15:03:20,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:20,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-13 15:03:20,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-13 15:03:20,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:20,820 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:20,821 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-13 15:03:20,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:20,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:20,907 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-13 15:03:20,907 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:20,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:20,907 INFO L82 PathProgramCache]: Analyzing trace with hash 550866052, now seen corresponding path program 1 times [2021-06-13 15:03:20,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:20,908 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297551857] [2021-06-13 15:03:20,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:20,964 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-13 15:03:20,964 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:20,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297551857] [2021-06-13 15:03:20,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297551857] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 15:03:20,964 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 15:03:20,965 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-13 15:03:20,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025120510] [2021-06-13 15:03:20,966 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-13 15:03:20,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:20,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-13 15:03:20,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-13 15:03:20,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:20,967 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:20,967 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 15:03:20,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:20,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:21,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,163 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-13 15:03:21,163 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:21,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:21,164 INFO L82 PathProgramCache]: Analyzing trace with hash -638751681, now seen corresponding path program 1 times [2021-06-13 15:03:21,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:21,164 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072212323] [2021-06-13 15:03:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:21,341 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2021-06-13 15:03:21,341 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:21,341 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072212323] [2021-06-13 15:03:21,342 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072212323] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 15:03:21,342 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 15:03:21,342 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-13 15:03:21,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356001680] [2021-06-13 15:03:21,343 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-13 15:03:21,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:21,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-13 15:03:21,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-13 15:03:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:21,344 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:21,344 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-13 15:03:21,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:21,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:21,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:21,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,452 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-13 15:03:21,452 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:21,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:21,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1082197813, now seen corresponding path program 1 times [2021-06-13 15:03:21,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:21,453 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659296877] [2021-06-13 15:03:21,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2021-06-13 15:03:21,535 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:21,535 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659296877] [2021-06-13 15:03:21,535 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659296877] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 15:03:21,535 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 15:03:21,536 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-13 15:03:21,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146242011] [2021-06-13 15:03:21,536 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-13 15:03:21,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:21,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-13 15:03:21,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-13 15:03:21,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:21,537 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:21,537 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-13 15:03:21,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:21,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:21,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:21,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,663 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-13 15:03:21,663 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:21,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:21,663 INFO L82 PathProgramCache]: Analyzing trace with hash -649443018, now seen corresponding path program 2 times [2021-06-13 15:03:21,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:21,664 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36024832] [2021-06-13 15:03:21,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2021-06-13 15:03:21,771 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:21,772 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36024832] [2021-06-13 15:03:21,772 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36024832] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 15:03:21,772 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 15:03:21,773 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-13 15:03:21,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628616190] [2021-06-13 15:03:21,774 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-13 15:03:21,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:21,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-13 15:03:21,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-13 15:03:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:21,775 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:21,775 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-13 15:03:21,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:21,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:21,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:21,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,867 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-13 15:03:21,867 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:21,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:21,868 INFO L82 PathProgramCache]: Analyzing trace with hash 542153915, now seen corresponding path program 2 times [2021-06-13 15:03:21,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:21,900 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388716920] [2021-06-13 15:03:21,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-06-13 15:03:21,953 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:21,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388716920] [2021-06-13 15:03:21,954 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388716920] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 15:03:21,954 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 15:03:21,954 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-13 15:03:21,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601871684] [2021-06-13 15:03:21,954 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-13 15:03:21,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:21,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-13 15:03:21,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-13 15:03:21,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:21,960 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:21,960 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-13 15:03:21,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:21,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:21,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:22,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,017 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-13 15:03:22,017 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:22,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:22,018 INFO L82 PathProgramCache]: Analyzing trace with hash -250395749, now seen corresponding path program 3 times [2021-06-13 15:03:22,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:22,019 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579858668] [2021-06-13 15:03:22,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-06-13 15:03:22,067 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:22,068 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579858668] [2021-06-13 15:03:22,068 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579858668] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 15:03:22,068 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 15:03:22,068 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-13 15:03:22,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715648657] [2021-06-13 15:03:22,069 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-13 15:03:22,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:22,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-13 15:03:22,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-13 15:03:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:22,070 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:22,071 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-13 15:03:22,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:22,157 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-13 15:03:22,157 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:22,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:22,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1143725701, now seen corresponding path program 4 times [2021-06-13 15:03:22,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:22,159 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110042023] [2021-06-13 15:03:22,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-06-13 15:03:22,207 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:22,208 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110042023] [2021-06-13 15:03:22,209 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110042023] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 15:03:22,209 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 15:03:22,209 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-13 15:03:22,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082236059] [2021-06-13 15:03:22,213 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-13 15:03:22,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:22,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-13 15:03:22,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-13 15:03:22,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:22,214 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:22,214 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-13 15:03:22,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:22,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:22,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:22,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:22,322 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-13 15:03:22,322 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:22,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:22,323 INFO L82 PathProgramCache]: Analyzing trace with hash 698179790, now seen corresponding path program 5 times [2021-06-13 15:03:22,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:22,323 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773720151] [2021-06-13 15:03:22,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:22,345 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-06-13 15:03:22,345 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:22,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773720151] [2021-06-13 15:03:22,345 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773720151] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 15:03:22,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 15:03:22,346 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-13 15:03:22,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757479398] [2021-06-13 15:03:22,348 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-13 15:03:22,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:22,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-13 15:03:22,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-13 15:03:22,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:22,349 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:22,349 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-13 15:03:22,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:22,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:22,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:22,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:22,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:22,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:22,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:22,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,498 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-13 15:03:22,498 INFO L430 AbstractCegarLoop]: === Iteration 10 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:22,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:22,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1134509750, now seen corresponding path program 6 times [2021-06-13 15:03:22,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:22,499 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632961031] [2021-06-13 15:03:22,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:22,587 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 101 proven. 26 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-06-13 15:03:22,587 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:22,587 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632961031] [2021-06-13 15:03:22,587 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632961031] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-13 15:03:22,587 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754319459] [2021-06-13 15:03:22,587 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-13 15:03:22,652 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-13 15:03:22,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-13 15:03:22,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-13 15:03:22,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-13 15:03:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 22 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-06-13 15:03:22,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754319459] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-13 15:03:22,962 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-13 15:03:22,962 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2021-06-13 15:03:22,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541482298] [2021-06-13 15:03:22,965 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-13 15:03:22,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:22,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-13 15:03:22,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-06-13 15:03:22,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:22,966 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:22,966 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 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-13 15:03:22,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:22,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:22,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:22,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:22,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-13 15:03:23,919 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-06-13 15:03:23,920 INFO L430 AbstractCegarLoop]: === Iteration 11 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:23,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:23,920 INFO L82 PathProgramCache]: Analyzing trace with hash 367022597, now seen corresponding path program 7 times [2021-06-13 15:03:23,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:23,921 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235381297] [2021-06-13 15:03:23,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 100 proven. 107 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-06-13 15:03:24,028 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:24,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235381297] [2021-06-13 15:03:24,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235381297] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-13 15:03:24,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548863547] [2021-06-13 15:03:24,029 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-13 15:03:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:24,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-13 15:03:24,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-13 15:03:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 100 proven. 107 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-06-13 15:03:24,320 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548863547] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-13 15:03:24,320 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-13 15:03:24,321 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2021-06-13 15:03:24,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416547930] [2021-06-13 15:03:24,321 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-13 15:03:24,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:24,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-13 15:03:24,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-13 15:03:24,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:24,323 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:24,324 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-13 15:03:24,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:24,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:24,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:24,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:24,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:24,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:24,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:24,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:24,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:24,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-06-13 15:03:24,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-13 15:03:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-13 15:03:24,985 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-06-13 15:03:24,985 INFO L430 AbstractCegarLoop]: === Iteration 12 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:24,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:24,985 INFO L82 PathProgramCache]: Analyzing trace with hash -87956623, now seen corresponding path program 8 times [2021-06-13 15:03:24,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:24,986 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471526058] [2021-06-13 15:03:24,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-13 15:03:25,002 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-13 15:03:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-13 15:03:25,015 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-13 15:03:25,040 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-13 15:03:25,041 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-13 15:03:25,041 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-13 15:03:25,050 INFO L301 ceAbstractionStarter]: Result for error location Process2Thread1of1ForFork2 was UNSAFE (1/5) [2021-06-13 15:03:25,053 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-13 15:03:25,058 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 15:03:25,058 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 15:03:25,058 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 15:03:25,058 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 15:03:25,058 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 15:03:25,058 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 15:03:25,058 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 15:03:25,058 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2======== [2021-06-13 15:03:25,355 INFO L301 ceAbstractionStarter]: Result for error location Process2 was SAFE (2/5) [2021-06-13 15:03:25,356 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-13 15:03:25,364 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 15:03:25,364 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 15:03:25,364 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 15:03:25,364 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 15:03:25,364 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 15:03:25,364 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 15:03:25,365 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 15:03:25,365 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1======== [2021-06-13 15:03:25,625 INFO L301 ceAbstractionStarter]: Result for error location Process1 was SAFE (3/5) [2021-06-13 15:03:25,626 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-13 15:03:25,630 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 15:03:25,630 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 15:03:25,631 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 15:03:25,631 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 15:03:25,631 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 15:03:25,631 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 15:03:25,631 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 15:03:25,631 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-13 15:03:25,867 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (4/5) [2021-06-13 15:03:25,867 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-13 15:03:25,872 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 15:03:25,872 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 15:03:25,872 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 15:03:25,872 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 15:03:25,872 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 15:03:25,872 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 15:03:25,872 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 15:03:25,872 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1Thread1of1ForFork1======== [2021-06-13 15:03:25,875 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:25,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:25,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1986709147, now seen corresponding path program 1 times [2021-06-13 15:03:25,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:25,876 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973449802] [2021-06-13 15:03:25,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:25,880 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-13 15:03:25,880 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:25,880 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973449802] [2021-06-13 15:03:25,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973449802] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 15:03:25,880 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 15:03:25,880 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-13 15:03:25,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148537548] [2021-06-13 15:03:25,880 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-13 15:03:25,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:25,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-13 15:03:25,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-13 15:03:25,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:25,881 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:25,881 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 15:03:25,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:25,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:25,920 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-13 15:03:25,920 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:25,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:25,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1309413604, now seen corresponding path program 1 times [2021-06-13 15:03:25,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:25,921 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205325629] [2021-06-13 15:03:25,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:25,928 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-13 15:03:25,928 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:25,928 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205325629] [2021-06-13 15:03:25,928 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205325629] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 15:03:25,928 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 15:03:25,928 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-13 15:03:25,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566573767] [2021-06-13 15:03:25,929 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-13 15:03:25,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:25,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-13 15:03:25,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-13 15:03:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:25,929 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:25,930 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 15:03:25,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:25,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,010 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-13 15:03:26,010 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:26,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:26,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1273138009, now seen corresponding path program 1 times [2021-06-13 15:03:26,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:26,010 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55343403] [2021-06-13 15:03:26,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2021-06-13 15:03:26,048 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:26,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55343403] [2021-06-13 15:03:26,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55343403] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 15:03:26,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 15:03:26,049 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-13 15:03:26,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814088182] [2021-06-13 15:03:26,049 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-13 15:03:26,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:26,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-13 15:03:26,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-13 15:03:26,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,050 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:26,050 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 15:03:26,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,082 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-13 15:03:26,083 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:26,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:26,083 INFO L82 PathProgramCache]: Analyzing trace with hash -349652305, now seen corresponding path program 1 times [2021-06-13 15:03:26,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:26,083 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642728975] [2021-06-13 15:03:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2021-06-13 15:03:26,107 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:26,107 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642728975] [2021-06-13 15:03:26,107 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642728975] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 15:03:26,108 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 15:03:26,108 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-13 15:03:26,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492989250] [2021-06-13 15:03:26,108 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-13 15:03:26,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:26,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-13 15:03:26,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-13 15:03:26,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,109 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:26,109 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 15:03:26,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,141 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-13 15:03:26,141 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:26,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:26,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1122987757, now seen corresponding path program 2 times [2021-06-13 15:03:26,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:26,143 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20256289] [2021-06-13 15:03:26,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-13 15:03:26,168 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:26,168 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20256289] [2021-06-13 15:03:26,168 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20256289] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 15:03:26,168 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 15:03:26,168 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-13 15:03:26,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948293460] [2021-06-13 15:03:26,168 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-13 15:03:26,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:26,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-13 15:03:26,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-13 15:03:26,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,169 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:26,169 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 15:03:26,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,210 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-13 15:03:26,210 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:26,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:26,210 INFO L82 PathProgramCache]: Analyzing trace with hash 582325919, now seen corresponding path program 2 times [2021-06-13 15:03:26,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:26,210 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190595691] [2021-06-13 15:03:26,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-06-13 15:03:26,226 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:26,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190595691] [2021-06-13 15:03:26,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190595691] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 15:03:26,226 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 15:03:26,226 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-13 15:03:26,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516816116] [2021-06-13 15:03:26,228 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-13 15:03:26,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:26,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-13 15:03:26,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-13 15:03:26,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,230 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:26,230 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-13 15:03:26,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:26,273 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-13 15:03:26,273 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:26,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:26,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1871952769, now seen corresponding path program 3 times [2021-06-13 15:03:26,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:26,274 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718306481] [2021-06-13 15:03:26,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-06-13 15:03:26,296 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:26,296 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718306481] [2021-06-13 15:03:26,296 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718306481] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 15:03:26,297 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 15:03:26,297 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-13 15:03:26,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229535789] [2021-06-13 15:03:26,297 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-13 15:03:26,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:26,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-13 15:03:26,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-13 15:03:26,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,298 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:26,298 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 15:03:26,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:26,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:26,384 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-13 15:03:26,385 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:26,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:26,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1067953762, now seen corresponding path program 4 times [2021-06-13 15:03:26,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:26,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024747118] [2021-06-13 15:03:26,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-06-13 15:03:26,404 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:26,404 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024747118] [2021-06-13 15:03:26,405 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024747118] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 15:03:26,405 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 15:03:26,405 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-13 15:03:26,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889437794] [2021-06-13 15:03:26,405 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-13 15:03:26,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:26,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-13 15:03:26,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-13 15:03:26,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,406 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:26,406 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 15:03:26,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:26,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:26,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,454 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-13 15:03:26,455 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:26,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:26,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1425213936, now seen corresponding path program 5 times [2021-06-13 15:03:26,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:26,455 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125666316] [2021-06-13 15:03:26,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 15:03:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 70 proven. 26 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-13 15:03:26,516 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 15:03:26,516 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125666316] [2021-06-13 15:03:26,516 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125666316] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-13 15:03:26,516 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392681218] [2021-06-13 15:03:26,516 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-13 15:03:26,630 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-06-13 15:03:26,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-13 15:03:26,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-13 15:03:26,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-13 15:03:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 76 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-06-13 15:03:26,826 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392681218] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-13 15:03:26,826 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-13 15:03:26,826 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-13 15:03:26,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067626958] [2021-06-13 15:03:26,827 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-13 15:03:26,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 15:03:26,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-13 15:03:26,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-06-13 15:03:26,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,827 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-13 15:03:26,827 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 8.4) internal successors, (126), 15 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 15:03:26,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:26,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:26,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:26,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:26,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:27,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-13 15:03:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-13 15:03:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 15:03:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-13 15:03:28,133 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-06-13 15:03:28,133 INFO L430 AbstractCegarLoop]: === Iteration 10 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-13 15:03:28,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 15:03:28,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1125706795, now seen corresponding path program 6 times [2021-06-13 15:03:28,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 15:03:28,134 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155855436] [2021-06-13 15:03:28,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 15:03:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-13 15:03:28,148 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-13 15:03:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-13 15:03:28,167 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-13 15:03:28,178 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-13 15:03:28,178 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-13 15:03:28,179 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-13 15:03:28,181 INFO L301 ceAbstractionStarter]: Result for error location Process1Thread1of1ForFork1 was UNSAFE (5/5) [2021-06-13 15:03:28,182 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-13 15:03:28,249 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.06 03:03:28 BasicIcfg [2021-06-13 15:03:28,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-13 15:03:28,250 INFO L168 Benchmark]: Toolchain (without parser) took 8114.45 ms. Allocated memory was 183.5 MB in the beginning and 321.9 MB in the end (delta: 138.4 MB). Free memory was 163.5 MB in the beginning and 127.6 MB in the end (delta: 35.9 MB). Peak memory consumption was 174.9 MB. Max. memory is 8.0 GB. [2021-06-13 15:03:28,250 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 ms. Allocated memory is still 183.5 MB. Free memory is still 164.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-13 15:03:28,250 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.00 ms. Allocated memory is still 183.5 MB. Free memory was 163.5 MB in the beginning and 162.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-06-13 15:03:28,250 INFO L168 Benchmark]: Boogie Preprocessor took 15.05 ms. Allocated memory is still 183.5 MB. Free memory was 162.0 MB in the beginning and 160.9 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 8.0 GB. [2021-06-13 15:03:28,250 INFO L168 Benchmark]: RCFGBuilder took 235.10 ms. Allocated memory is still 183.5 MB. Free memory was 160.9 MB in the beginning and 148.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-06-13 15:03:28,250 INFO L168 Benchmark]: TraceAbstraction took 7830.95 ms. Allocated memory was 183.5 MB in the beginning and 321.9 MB in the end (delta: 138.4 MB). Free memory was 147.9 MB in the beginning and 127.6 MB in the end (delta: 20.3 MB). Peak memory consumption was 159.1 MB. Max. memory is 8.0 GB. [2021-06-13 15:03:28,251 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 183.5 MB. Free memory is still 164.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 29.00 ms. Allocated memory is still 183.5 MB. Free memory was 163.5 MB in the beginning and 162.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 15.05 ms. Allocated memory is still 183.5 MB. Free memory was 162.0 MB in the beginning and 160.9 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 8.0 GB. * RCFGBuilder took 235.10 ms. Allocated memory is still 183.5 MB. Free memory was 160.9 MB in the beginning and 148.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7830.95 ms. Allocated memory was 183.5 MB in the beginning and 321.9 MB in the end (delta: 138.4 MB). Free memory was 147.9 MB in the beginning and 127.6 MB in the end (delta: 20.3 MB). Peak memory consumption was 159.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 41550, positive: 31025, positive conditional: 31025, positive unconditional: 0, negative: 10525, negative conditional: 10525, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 34197, positive: 31025, positive conditional: 31025, positive unconditional: 0, negative: 3172, negative conditional: 3172, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 34197, positive: 30911, positive conditional: 0, positive unconditional: 30911, negative: 3286, negative conditional: 0, negative unconditional: 3286, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 497, positive: 461, positive conditional: 0, positive unconditional: 461, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 497, positive: 437, positive conditional: 0, positive unconditional: 437, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 203, positive: 39, positive conditional: 15, positive unconditional: 24, negative: 164, negative conditional: 128, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 410, positive: 62, positive conditional: 31, positive unconditional: 31, negative: 348, negative conditional: 230, negative unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34197, positive: 30450, positive conditional: 0, positive unconditional: 30450, negative: 3250, negative conditional: 0, negative unconditional: 3250, unknown: 497, unknown conditional: 0, unknown unconditional: 497] , Statistics on independence cache: Total cache size (in pairs): 640, Positive cache size: 476, Positive conditional cache size: 15, Positive unconditional cache size: 461, Negative cache size: 164, Negative conditional cache size: 128, Negative unconditional cache size: 36, SemanticConditionEliminator.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 203, positive: 39, positive conditional: 15, positive unconditional: 24, negative: 164, negative conditional: 128, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 410, positive: 62, positive conditional: 31, positive unconditional: 31, negative: 348, negative conditional: 230, negative unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26823, positive: 99, positive conditional: 99, positive unconditional: 0, negative: 26581, negative conditional: 4393, negative unconditional: 22188, unknown: 143, unknown conditional: 143, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 640, Positive cache size: 476, Positive conditional cache size: 15, Positive unconditional cache size: 461, Negative cache size: 164, Negative conditional cache size: 128, Negative unconditional cache size: 36, Eliminated conditions: 22188, SemanticConditionEliminator.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 203, positive: 39, positive conditional: 15, positive unconditional: 24, negative: 164, negative conditional: 128, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 410, positive: 62, positive conditional: 31, positive unconditional: 31, negative: 348, negative conditional: 230, negative unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26823, positive: 99, positive conditional: 99, positive unconditional: 0, negative: 26581, negative conditional: 4393, negative unconditional: 22188, unknown: 143, unknown conditional: 143, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 640, Positive cache size: 476, Positive conditional cache size: 15, Positive unconditional cache size: 461, Negative cache size: 164, Negative conditional cache size: 128, Negative unconditional cache size: 36, Eliminated conditions: 22188, SemanticConditionEliminator.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 203, positive: 39, positive conditional: 15, positive unconditional: 24, negative: 164, negative conditional: 128, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 410, positive: 62, positive conditional: 31, positive unconditional: 31, negative: 348, negative conditional: 230, negative unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26823, positive: 99, positive conditional: 99, positive unconditional: 0, negative: 26581, negative conditional: 4393, negative unconditional: 22188, unknown: 143, unknown conditional: 143, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 640, Positive cache size: 476, Positive conditional cache size: 15, Positive unconditional cache size: 461, Negative cache size: 164, Negative conditional cache size: 128, Negative unconditional cache size: 36, Eliminated conditions: 22188, SemanticConditionEliminator.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 203, positive: 39, positive conditional: 15, positive unconditional: 24, negative: 164, negative conditional: 128, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 410, positive: 62, positive conditional: 31, positive unconditional: 31, negative: 348, negative conditional: 230, negative unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26823, positive: 99, positive conditional: 99, positive unconditional: 0, negative: 26581, negative conditional: 4393, negative unconditional: 22188, unknown: 143, unknown conditional: 143, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 640, Positive cache size: 476, Positive conditional cache size: 15, Positive unconditional cache size: 461, Negative cache size: 164, Negative conditional cache size: 128, Negative unconditional cache size: 36, Eliminated conditions: 22188, SemanticConditionEliminator.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 203, positive: 39, positive conditional: 15, positive unconditional: 24, negative: 164, negative conditional: 128, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 410, positive: 62, positive conditional: 31, positive unconditional: 31, negative: 348, negative conditional: 230, negative unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26823, positive: 99, positive conditional: 99, positive unconditional: 0, negative: 26581, negative conditional: 4393, negative unconditional: 22188, unknown: 143, unknown conditional: 143, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 640, Positive cache size: 476, Positive conditional cache size: 15, Positive unconditional cache size: 461, Negative cache size: 164, Negative conditional cache size: 128, Negative unconditional cache size: 36, Eliminated conditions: 22188, SemanticConditionEliminator.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 203, positive: 39, positive conditional: 15, positive unconditional: 24, negative: 164, negative conditional: 128, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 410, positive: 62, positive conditional: 31, positive unconditional: 31, negative: 348, negative conditional: 230, negative unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26823, positive: 99, positive conditional: 99, positive unconditional: 0, negative: 26581, negative conditional: 4393, negative unconditional: 22188, unknown: 143, unknown conditional: 143, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 640, Positive cache size: 476, Positive conditional cache size: 15, Positive unconditional cache size: 461, Negative cache size: 164, Negative conditional cache size: 128, Negative unconditional cache size: 36, Eliminated conditions: 22188, SemanticConditionEliminator.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 203, positive: 39, positive conditional: 15, positive unconditional: 24, negative: 164, negative conditional: 128, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 410, positive: 62, positive conditional: 31, positive unconditional: 31, negative: 348, negative conditional: 230, negative unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26823, positive: 99, positive conditional: 99, positive unconditional: 0, negative: 26581, negative conditional: 4393, negative unconditional: 22188, unknown: 143, unknown conditional: 143, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 640, Positive cache size: 476, Positive conditional cache size: 15, Positive unconditional cache size: 461, Negative cache size: 164, Negative conditional cache size: 128, Negative unconditional cache size: 36, Eliminated conditions: 22188, SemanticConditionEliminator.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 203, positive: 39, positive conditional: 15, positive unconditional: 24, negative: 164, negative conditional: 128, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 410, positive: 62, positive conditional: 31, positive unconditional: 31, negative: 348, negative conditional: 230, negative unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26823, positive: 99, positive conditional: 99, positive unconditional: 0, negative: 26581, negative conditional: 4393, negative unconditional: 22188, unknown: 143, unknown conditional: 143, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 640, Positive cache size: 476, Positive conditional cache size: 15, Positive unconditional cache size: 461, Negative cache size: 164, Negative conditional cache size: 128, Negative unconditional cache size: 36, Eliminated conditions: 22188, SemanticConditionEliminator.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 203, positive: 39, positive conditional: 15, positive unconditional: 24, negative: 164, negative conditional: 128, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 410, positive: 62, positive conditional: 31, positive unconditional: 31, negative: 348, negative conditional: 230, negative unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26823, positive: 99, positive conditional: 99, positive unconditional: 0, negative: 26581, negative conditional: 4393, negative unconditional: 22188, unknown: 143, unknown conditional: 143, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 640, Positive cache size: 476, Positive conditional cache size: 15, Positive unconditional cache size: 461, Negative cache size: 164, Negative conditional cache size: 128, Negative unconditional cache size: 36, Eliminated conditions: 22188, SemanticConditionEliminator.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 203, positive: 39, positive conditional: 15, positive unconditional: 24, negative: 164, negative conditional: 128, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 410, positive: 62, positive conditional: 31, positive unconditional: 31, negative: 348, negative conditional: 230, negative unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26823, positive: 99, positive conditional: 99, positive unconditional: 0, negative: 26581, negative conditional: 4393, negative unconditional: 22188, unknown: 143, unknown conditional: 143, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 640, Positive cache size: 476, Positive conditional cache size: 15, Positive unconditional cache size: 461, Negative cache size: 164, Negative conditional cache size: 128, Negative unconditional cache size: 36, Eliminated conditions: 22188, SemanticConditionEliminator.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26823, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 26709, negative conditional: 4521, negative unconditional: 22188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 203, positive: 39, positive conditional: 15, positive unconditional: 24, negative: 164, negative conditional: 128, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 410, positive: 62, positive conditional: 31, positive unconditional: 31, negative: 348, negative conditional: 230, negative unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26823, positive: 99, positive conditional: 99, positive unconditional: 0, negative: 26581, negative conditional: 4393, negative unconditional: 22188, unknown: 143, unknown conditional: 143, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 640, Positive cache size: 476, Positive conditional cache size: 15, Positive unconditional cache size: 461, Negative cache size: 164, Negative conditional cache size: 128, Negative unconditional cache size: 36, Eliminated conditions: 22188 ], Maximal queried relation: 11, Independence queries for same thread: 7353 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 29754, positive: 24006, positive conditional: 24006, positive unconditional: 0, negative: 5748, negative conditional: 5748, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 25295, positive: 24006, positive conditional: 24006, positive unconditional: 0, negative: 1289, negative conditional: 1289, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 25295, positive: 24006, positive conditional: 0, positive unconditional: 24006, negative: 1289, negative conditional: 0, negative unconditional: 1289, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 749, positive: 708, positive conditional: 0, positive unconditional: 708, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 749, positive: 681, positive conditional: 0, positive unconditional: 681, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 84, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25295, positive: 23298, positive conditional: 0, positive unconditional: 23298, negative: 1248, negative conditional: 0, negative unconditional: 1248, unknown: 749, unknown conditional: 0, unknown unconditional: 749] , Statistics on independence cache: Total cache size (in pairs): 749, Positive cache size: 708, Positive conditional cache size: 0, Positive unconditional cache size: 708, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 ], Maximal queried relation: 0, Independence queries for same thread: 4459 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 29754, positive: 24006, positive conditional: 24006, positive unconditional: 0, negative: 5748, negative conditional: 5748, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 25295, positive: 24006, positive conditional: 24006, positive unconditional: 0, negative: 1289, negative conditional: 1289, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 25295, positive: 24006, positive conditional: 0, positive unconditional: 24006, negative: 1289, negative conditional: 0, negative unconditional: 1289, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 749, positive: 708, positive conditional: 0, positive unconditional: 708, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 749, positive: 681, positive conditional: 0, positive unconditional: 681, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 82, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25295, positive: 23298, positive conditional: 0, positive unconditional: 23298, negative: 1248, negative conditional: 0, negative unconditional: 1248, unknown: 749, unknown conditional: 0, unknown unconditional: 749] , Statistics on independence cache: Total cache size (in pairs): 749, Positive cache size: 708, Positive conditional cache size: 0, Positive unconditional cache size: 708, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 ], Maximal queried relation: 0, Independence queries for same thread: 4459 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 29754, positive: 24006, positive conditional: 24006, positive unconditional: 0, negative: 5748, negative conditional: 5748, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 25295, positive: 24006, positive conditional: 24006, positive unconditional: 0, negative: 1289, negative conditional: 1289, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 25295, positive: 24006, positive conditional: 0, positive unconditional: 24006, negative: 1289, negative conditional: 0, negative unconditional: 1289, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 749, positive: 708, positive conditional: 0, positive unconditional: 708, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 749, positive: 681, positive conditional: 0, positive unconditional: 681, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25295, positive: 23298, positive conditional: 0, positive unconditional: 23298, negative: 1248, negative conditional: 0, negative unconditional: 1248, unknown: 749, unknown conditional: 0, unknown unconditional: 749] , Statistics on independence cache: Total cache size (in pairs): 749, Positive cache size: 708, Positive conditional cache size: 0, Positive unconditional cache size: 708, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 ], Maximal queried relation: 0, Independence queries for same thread: 4459 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 29089, positive: 21776, positive conditional: 21776, positive unconditional: 0, negative: 7313, negative conditional: 7313, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 23939, positive: 21776, positive conditional: 21776, positive unconditional: 0, negative: 2163, negative conditional: 2163, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 23939, positive: 21698, positive conditional: 0, positive unconditional: 21698, negative: 2241, negative conditional: 0, negative unconditional: 2241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 532, positive: 496, positive conditional: 0, positive unconditional: 496, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 532, positive: 473, positive conditional: 0, positive unconditional: 473, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 196, positive: 37, positive conditional: 14, positive unconditional: 23, negative: 159, negative conditional: 123, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, positive: 20, positive conditional: 8, positive unconditional: 12, negative: 210, negative conditional: 118, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23939, positive: 21202, positive conditional: 0, positive unconditional: 21202, negative: 2205, negative conditional: 0, negative unconditional: 2205, unknown: 532, unknown conditional: 0, unknown unconditional: 532] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 510, Positive conditional cache size: 14, Positive unconditional cache size: 496, Negative cache size: 159, Negative conditional cache size: 123, Negative unconditional cache size: 36, SemanticConditionEliminator.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 196, positive: 37, positive conditional: 14, positive unconditional: 23, negative: 159, negative conditional: 123, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, positive: 20, positive conditional: 8, positive unconditional: 12, negative: 210, negative conditional: 118, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15489, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15288, negative conditional: 2063, negative unconditional: 13225, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 510, Positive conditional cache size: 14, Positive unconditional cache size: 496, Negative cache size: 159, Negative conditional cache size: 123, Negative unconditional cache size: 36, Eliminated conditions: 13225, SemanticConditionEliminator.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 196, positive: 37, positive conditional: 14, positive unconditional: 23, negative: 159, negative conditional: 123, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, positive: 20, positive conditional: 8, positive unconditional: 12, negative: 210, negative conditional: 118, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15489, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15288, negative conditional: 2063, negative unconditional: 13225, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 510, Positive conditional cache size: 14, Positive unconditional cache size: 496, Negative cache size: 159, Negative conditional cache size: 123, Negative unconditional cache size: 36, Eliminated conditions: 13225, SemanticConditionEliminator.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 196, positive: 37, positive conditional: 14, positive unconditional: 23, negative: 159, negative conditional: 123, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, positive: 20, positive conditional: 8, positive unconditional: 12, negative: 210, negative conditional: 118, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15489, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15288, negative conditional: 2063, negative unconditional: 13225, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 510, Positive conditional cache size: 14, Positive unconditional cache size: 496, Negative cache size: 159, Negative conditional cache size: 123, Negative unconditional cache size: 36, Eliminated conditions: 13225, SemanticConditionEliminator.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 196, positive: 37, positive conditional: 14, positive unconditional: 23, negative: 159, negative conditional: 123, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, positive: 20, positive conditional: 8, positive unconditional: 12, negative: 210, negative conditional: 118, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15489, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15288, negative conditional: 2063, negative unconditional: 13225, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 510, Positive conditional cache size: 14, Positive unconditional cache size: 496, Negative cache size: 159, Negative conditional cache size: 123, Negative unconditional cache size: 36, Eliminated conditions: 13225, SemanticConditionEliminator.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 196, positive: 37, positive conditional: 14, positive unconditional: 23, negative: 159, negative conditional: 123, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, positive: 20, positive conditional: 8, positive unconditional: 12, negative: 210, negative conditional: 118, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15489, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15288, negative conditional: 2063, negative unconditional: 13225, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 510, Positive conditional cache size: 14, Positive unconditional cache size: 496, Negative cache size: 159, Negative conditional cache size: 123, Negative unconditional cache size: 36, Eliminated conditions: 13225, SemanticConditionEliminator.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 196, positive: 37, positive conditional: 14, positive unconditional: 23, negative: 159, negative conditional: 123, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, positive: 20, positive conditional: 8, positive unconditional: 12, negative: 210, negative conditional: 118, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15489, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15288, negative conditional: 2063, negative unconditional: 13225, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 510, Positive conditional cache size: 14, Positive unconditional cache size: 496, Negative cache size: 159, Negative conditional cache size: 123, Negative unconditional cache size: 36, Eliminated conditions: 13225, SemanticConditionEliminator.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 196, positive: 37, positive conditional: 14, positive unconditional: 23, negative: 159, negative conditional: 123, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, positive: 20, positive conditional: 8, positive unconditional: 12, negative: 210, negative conditional: 118, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15489, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15288, negative conditional: 2063, negative unconditional: 13225, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 510, Positive conditional cache size: 14, Positive unconditional cache size: 496, Negative cache size: 159, Negative conditional cache size: 123, Negative unconditional cache size: 36, Eliminated conditions: 13225, SemanticConditionEliminator.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 196, positive: 37, positive conditional: 14, positive unconditional: 23, negative: 159, negative conditional: 123, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, positive: 20, positive conditional: 8, positive unconditional: 12, negative: 210, negative conditional: 118, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15489, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15288, negative conditional: 2063, negative unconditional: 13225, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 510, Positive conditional cache size: 14, Positive unconditional cache size: 496, Negative cache size: 159, Negative conditional cache size: 123, Negative unconditional cache size: 36, Eliminated conditions: 13225, SemanticConditionEliminator.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15489, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 15411, negative conditional: 2186, negative unconditional: 13225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 196, positive: 37, positive conditional: 14, positive unconditional: 23, negative: 159, negative conditional: 123, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, positive: 20, positive conditional: 8, positive unconditional: 12, negative: 210, negative conditional: 118, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15489, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 15288, negative conditional: 2063, negative unconditional: 13225, unknown: 137, unknown conditional: 137, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 510, Positive conditional cache size: 14, Positive unconditional cache size: 496, Negative cache size: 159, Negative conditional cache size: 123, Negative unconditional cache size: 36, Eliminated conditions: 13225 ], Maximal queried relation: 9, Independence queries for same thread: 5150 - CounterExampleResult [Line: 87]: assertion can be violated assertion can be violated We found a FailurePath: [L28] 0 critical := 0; VAL [critical=0] [L29] 0 clk := 0; VAL [clk=0, critical=0] [L30] 0 assume wait >= 1; VAL [clk=0, critical=0, wait=1] [L33] 0 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK 0 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK 0 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=1, critical=1, deadline=1, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=3, critical=1, deadline=2, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=0, deadline=2, delay=1, lock=0, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=5, critical=0, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=5, critical=0, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=6, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=6, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=6, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=6, critical=2, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=6, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=6, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=6, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=6, critical=0, deadline=2, deadline=7, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=6, critical=0, deadline=2, deadline=7, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=6, critical=0, deadline=2, deadline=7, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=6, critical=0, deadline=2, deadline=7, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=6, critical=0, deadline=2, deadline=7, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=6, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=7, critical=2, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=7, critical=0, deadline=8, deadline=8, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=8, critical=0, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=8, critical=0, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=8, critical=1, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=8, critical=0, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=9, critical=0, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=9, critical=0, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=9, critical=0, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=9, critical=0, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=9, critical=2, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=9, critical=0, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=9, critical=0, deadline=8, deadline=9, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=9, critical=0, deadline=8, deadline=9, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=9, critical=0, deadline=8, deadline=10, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=9, critical=0, deadline=8, deadline=10, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=9, critical=0, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=9, critical=0, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=9, critical=0, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=10, critical=0, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=10, critical=0, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=10, critical=0, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=10, critical=0, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=10, critical=2, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=10, critical=0, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=10, critical=0, deadline=8, deadline=10, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=10, critical=0, deadline=8, deadline=10, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=10, critical=0, deadline=8, deadline=11, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=10, critical=0, deadline=8, deadline=11, delay=1, lock=0, wait=1] [L69] 2 lock := 0; VAL [clk=10, critical=0, deadline=8, deadline=11, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=10, critical=0, deadline=8, deadline=11, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=11, critical=2, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=11, critical=0, deadline=12, deadline=11, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=12, critical=0, deadline=12, deadline=11, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=12, critical=0, deadline=12, deadline=11, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=12, critical=0, deadline=12, deadline=11, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=12, critical=0, deadline=12, deadline=11, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=12, critical=0, deadline=12, deadline=11, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=12, critical=0, deadline=12, deadline=13, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=12, critical=0, deadline=12, deadline=13, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=12, critical=0, deadline=12, deadline=13, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=12, critical=0, deadline=12, deadline=13, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=12, critical=0, deadline=12, deadline=13, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=12, critical=1, deadline=12, deadline=13, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=13, critical=1, deadline=12, deadline=13, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=13, critical=1, deadline=12, deadline=14, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=14, critical=1, deadline=12, deadline=14, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=14, critical=1, deadline=12, deadline=14, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=14, critical=1, deadline=12, deadline=14, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=14, critical=1, deadline=12, deadline=14, delay=1, lock=2, wait=1] - CounterExampleResult [Line: 66]: assertion can be violated assertion can be violated We found a FailurePath: [L28] 0 critical := 0; VAL [critical=0] [L29] 0 clk := 0; VAL [clk=0, critical=0] [L30] 0 assume wait >= 1; VAL [clk=0, critical=0, wait=1] [L33] 0 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK 0 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK 0 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=1, critical=1, deadline=1, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=3, critical=1, deadline=2, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=5, critical=2, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=6, critical=2, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=6, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=7, critical=1, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=8, critical=2, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L69] 2 lock := 0; VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=9, critical=2, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=9, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=10, critical=0, deadline=10, deadline=11, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=10, critical=0, deadline=10, deadline=11, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=10, critical=0, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=10, critical=0, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=11, critical=0, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=11, critical=0, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=12, critical=0, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=12, critical=0, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=12, critical=0, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=12, critical=0, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=12, critical=2, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=12, critical=2, deadline=10, deadline=12, delay=1, lock=2, wait=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process2Thread1of1ForFork2 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4555.8ms, OverallIterations: 12, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.8ms, PartialOrderReductionTime: 2198.5ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 54.6ms SsaConstructionTime, 299.1ms SatisfiabilityAnalysisTime, 1107.4ms InterpolantComputationTime, 1664 NumberOfCodeBlocks, 1664 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1514 ConstructedInterpolants, 0 QuantifiedInterpolants, 2744 SizeOfPredicates, 8 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 3241/3503 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: 300.8ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.0ms, PartialOrderReductionTime: 294.6ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process1 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 268.4ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.0ms, PartialOrderReductionTime: 258.9ms, 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: 240.5ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.8ms, PartialOrderReductionTime: 234.8ms, 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: 2312.5ms, OverallIterations: 10, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.8ms, PartialOrderReductionTime: 1483.3ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 15.8ms SsaConstructionTime, 131.6ms SatisfiabilityAnalysisTime, 343.8ms InterpolantComputationTime, 1116 NumberOfCodeBlocks, 1116 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 983 ConstructedInterpolants, 0 QuantifiedInterpolants, 1663 SizeOfPredicates, 4 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 1866/1918 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...