/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-DelaySleep-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-06 03:03:03,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-06 03:03:03,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-06 03:03:03,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-06 03:03:03,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-06 03:03:03,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-06 03:03:03,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-06 03:03:03,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-06 03:03:03,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-06 03:03:03,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-06 03:03:03,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-06 03:03:03,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-06 03:03:03,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-06 03:03:03,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-06 03:03:03,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-06 03:03:03,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-06 03:03:03,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-06 03:03:03,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-06 03:03:03,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-06 03:03:03,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-06 03:03:03,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-06 03:03:03,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-06 03:03:03,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-06 03:03:03,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-06 03:03:03,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-06 03:03:03,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-06 03:03:03,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-06 03:03:03,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-06 03:03:03,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-06 03:03:03,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-06 03:03:03,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-06 03:03:03,227 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-06 03:03:03,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-06 03:03:03,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-06 03:03:03,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-06 03:03:03,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-06 03:03:03,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-06 03:03:03,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-06 03:03:03,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-06 03:03:03,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-06 03:03:03,231 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-06 03:03:03,232 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-DelaySleep-NoLbe.epf [2021-06-06 03:03:03,252 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-06 03:03:03,253 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-06 03:03:03,253 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-06 03:03:03,253 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-06 03:03:03,254 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-06 03:03:03,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-06 03:03:03,254 INFO L138 SettingsManager]: * Use SBE=true [2021-06-06 03:03:03,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-06 03:03:03,255 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-06 03:03:03,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-06 03:03:03,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-06 03:03:03,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-06 03:03:03,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-06 03:03:03,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-06 03:03:03,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-06 03:03:03,256 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-06 03:03:03,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-06 03:03:03,256 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-06 03:03:03,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-06 03:03:03,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-06 03:03:03,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-06 03:03:03,256 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-06 03:03:03,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-06 03:03:03,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-06 03:03:03,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-06 03:03:03,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-06 03:03:03,257 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-06 03:03:03,257 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-06 03:03:03,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-06 03:03:03,257 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-06 03:03:03,257 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-06-06 03:03:03,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-06 03:03:03,258 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-06-06 03:03:03,258 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-06 03:03:03,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-06 03:03:03,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-06 03:03:03,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-06 03:03:03,552 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-06 03:03:03,553 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-06 03:03:03,554 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-06 03:03:03,554 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2021-06-06 03:03:03,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-06 03:03:03,584 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-06 03:03:03,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-06 03:03:03,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-06 03:03:03,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-06 03:03:03,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:03:03" (1/1) ... [2021-06-06 03:03:03,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:03:03" (1/1) ... [2021-06-06 03:03:03,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-06 03:03:03,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-06 03:03:03,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-06 03:03:03,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-06 03:03:03,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:03:03" (1/1) ... [2021-06-06 03:03:03,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:03:03" (1/1) ... [2021-06-06 03:03:03,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:03:03" (1/1) ... [2021-06-06 03:03:03,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:03:03" (1/1) ... [2021-06-06 03:03:03,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:03:03" (1/1) ... [2021-06-06 03:03:03,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:03:03" (1/1) ... [2021-06-06 03:03:03,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:03:03" (1/1) ... [2021-06-06 03:03:03,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-06 03:03:03,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-06 03:03:03,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-06 03:03:03,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-06 03:03:03,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:03:03" (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-06 03:03:03,676 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2021-06-06 03:03:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2021-06-06 03:03:03,676 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2021-06-06 03:03:03,677 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2021-06-06 03:03:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2021-06-06 03:03:03,677 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2021-06-06 03:03:03,677 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-06 03:03:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-06 03:03:03,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-06 03:03:03,677 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2021-06-06 03:03:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2021-06-06 03:03:03,678 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2021-06-06 03:03:03,678 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-06 03:03:03,840 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-06 03:03:03,840 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-06-06 03:03:03,842 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.06 03:03:03 BoogieIcfgContainer [2021-06-06 03:03:03,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-06 03:03:03,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-06 03:03:03,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-06 03:03:03,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-06 03:03:03,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:03:03" (1/2) ... [2021-06-06 03:03:03,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b88c8b and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.06 03:03:03, skipping insertion in model container [2021-06-06 03:03:03,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.06 03:03:03" (2/2) ... [2021-06-06 03:03:03,848 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2021-06-06 03:03:03,852 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-06 03:03:03,852 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-06 03:03:03,852 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-06 03:03:03,853 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-06 03:03:03,873 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,873 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,874 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,874 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,874 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,874 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,875 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,875 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,876 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,876 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,877 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,877 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,877 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,878 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,878 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,878 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,882 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,884 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 03:03:03,885 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-06 03:03:03,899 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-06 03:03:03,956 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-06 03:03:03,957 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-06 03:03:03,957 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-06 03:03:03,957 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-06 03:03:03,957 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-06 03:03:03,957 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-06 03:03:03,957 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-06 03:03:03,957 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2Thread1of1ForFork2======== [2021-06-06 03:03:03,983 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:03,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:03,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1912023374, now seen corresponding path program 1 times [2021-06-06 03:03:03,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:03,993 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765701726] [2021-06-06 03:03:03,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:04,131 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-06 03:03:04,131 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:04,131 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765701726] [2021-06-06 03:03:04,132 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765701726] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 03:03:04,132 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 03:03:04,132 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-06 03:03:04,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160597317] [2021-06-06 03:03:04,137 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-06 03:03:04,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:04,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-06 03:03:04,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-06 03:03:04,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,169 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:04,189 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-06 03:03:04,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,274 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-06 03:03:04,274 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:04,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:04,275 INFO L82 PathProgramCache]: Analyzing trace with hash -78718930, now seen corresponding path program 1 times [2021-06-06 03:03:04,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:04,275 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465657225] [2021-06-06 03:03:04,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:04,335 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-06 03:03:04,335 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:04,335 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465657225] [2021-06-06 03:03:04,336 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465657225] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 03:03:04,336 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 03:03:04,336 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 03:03:04,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379080094] [2021-06-06 03:03:04,342 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 03:03:04,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:04,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 03:03:04,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 03:03:04,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,343 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:04,344 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-06 03:03:04,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,388 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-06 03:03:04,388 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:04,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:04,389 INFO L82 PathProgramCache]: Analyzing trace with hash 2108149785, now seen corresponding path program 1 times [2021-06-06 03:03:04,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:04,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004756456] [2021-06-06 03:03:04,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:04,436 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-06 03:03:04,436 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:04,436 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004756456] [2021-06-06 03:03:04,437 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004756456] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 03:03:04,437 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 03:03:04,437 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 03:03:04,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525840928] [2021-06-06 03:03:04,437 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 03:03:04,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:04,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 03:03:04,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 03:03:04,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,439 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:04,439 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-06 03:03:04,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,523 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-06 03:03:04,524 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:04,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:04,524 INFO L82 PathProgramCache]: Analyzing trace with hash 698909355, now seen corresponding path program 1 times [2021-06-06 03:03:04,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:04,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128158986] [2021-06-06 03:03:04,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:04,549 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-06 03:03:04,549 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:04,549 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128158986] [2021-06-06 03:03:04,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128158986] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 03:03:04,550 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 03:03:04,550 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-06 03:03:04,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256424058] [2021-06-06 03:03:04,551 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 03:03:04,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:04,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 03:03:04,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 03:03:04,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,552 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:04,552 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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-06 03:03:04,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,742 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-06 03:03:04,742 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:04,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:04,743 INFO L82 PathProgramCache]: Analyzing trace with hash -428881414, now seen corresponding path program 1 times [2021-06-06 03:03:04,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:04,743 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296868908] [2021-06-06 03:03:04,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:04,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-06 03:03:04,781 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:04,781 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296868908] [2021-06-06 03:03:04,781 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296868908] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 03:03:04,782 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 03:03:04,782 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 03:03:04,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326334167] [2021-06-06 03:03:04,782 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 03:03:04,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:04,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 03:03:04,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 03:03:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,783 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:04,784 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-06 03:03:04,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,833 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-06 03:03:04,833 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:04,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:04,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1661244624, now seen corresponding path program 2 times [2021-06-06 03:03:04,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:04,834 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884661030] [2021-06-06 03:03:04,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-06-06 03:03:04,875 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:04,875 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884661030] [2021-06-06 03:03:04,876 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884661030] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 03:03:04,876 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 03:03:04,876 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 03:03:04,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066083975] [2021-06-06 03:03:04,877 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 03:03:04,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:04,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 03:03:04,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 03:03:04,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,878 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:04,878 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-06 03:03:04,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,921 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-06 03:03:04,921 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:04,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:04,921 INFO L82 PathProgramCache]: Analyzing trace with hash -497315924, now seen corresponding path program 3 times [2021-06-06 03:03:04,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:04,922 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416624500] [2021-06-06 03:03:04,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-06-06 03:03:04,958 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:04,958 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416624500] [2021-06-06 03:03:04,958 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416624500] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 03:03:04,958 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 03:03:04,958 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 03:03:04,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076890761] [2021-06-06 03:03:04,959 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 03:03:04,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:04,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 03:03:04,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 03:03:04,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,960 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:04,960 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-06 03:03:04,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:04,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:04,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:05,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:05,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,013 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-06 03:03:05,013 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:05,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:05,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1830740293, now seen corresponding path program 1 times [2021-06-06 03:03:05,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:05,014 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367666436] [2021-06-06 03:03:05,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:05,063 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-06-06 03:03:05,063 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:05,063 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367666436] [2021-06-06 03:03:05,064 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367666436] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 03:03:05,064 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 03:03:05,064 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-06 03:03:05,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645270667] [2021-06-06 03:03:05,065 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-06 03:03:05,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:05,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-06 03:03:05,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-06 03:03:05,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:05,065 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:05,066 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-06 03:03:05,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:05,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:05,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:05,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:05,143 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-06 03:03:05,143 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:05,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:05,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1042821701, now seen corresponding path program 1 times [2021-06-06 03:03:05,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:05,144 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5743206] [2021-06-06 03:03:05,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-06 03:03:05,175 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:05,175 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5743206] [2021-06-06 03:03:05,175 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5743206] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 03:03:05,176 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 03:03:05,176 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-06 03:03:05,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916349268] [2021-06-06 03:03:05,176 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-06 03:03:05,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:05,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-06 03:03:05,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-06 03:03:05,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:05,177 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:05,178 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-06 03:03:05,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:05,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:05,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:05,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:05,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:05,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:05,264 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-06 03:03:05,264 INFO L430 AbstractCegarLoop]: === Iteration 10 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:05,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:05,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1397418812, now seen corresponding path program 2 times [2021-06-06 03:03:05,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:05,265 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572445797] [2021-06-06 03:03:05,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:05,381 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-06 03:03:05,381 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:05,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572445797] [2021-06-06 03:03:05,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572445797] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-06 03:03:05,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332555591] [2021-06-06 03:03:05,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-06 03:03:05,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-06 03:03:05,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-06 03:03:05,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-06 03:03:05,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-06 03:03:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 36 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-06 03:03:05,794 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332555591] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-06 03:03:05,794 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-06 03:03:05,794 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-06 03:03:05,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869808260] [2021-06-06 03:03:05,796 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-06 03:03:05,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:05,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-06 03:03:05,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-06-06 03:03:05,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:05,798 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:05,799 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 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-06 03:03:05,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:05,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:05,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:05,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:05,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:07,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:07,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:07,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:07,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:07,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:07,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-06 03:03:07,240 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-06-06 03:03:07,241 INFO L430 AbstractCegarLoop]: === Iteration 11 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:07,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:07,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2105731021, now seen corresponding path program 3 times [2021-06-06 03:03:07,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:07,242 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988056705] [2021-06-06 03:03:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-06 03:03:07,258 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-06 03:03:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-06 03:03:07,280 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-06 03:03:07,297 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-06 03:03:07,298 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-06 03:03:07,298 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-06 03:03:07,312 INFO L301 ceAbstractionStarter]: Result for error location Process2Thread1of1ForFork2 was UNSAFE (1/5) [2021-06-06 03:03:07,315 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-06-06 03:03:07,324 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-06 03:03:07,324 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-06 03:03:07,324 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-06 03:03:07,324 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-06 03:03:07,325 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-06 03:03:07,325 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-06 03:03:07,325 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-06 03:03:07,325 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2======== Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-06 03:03:07,523 INFO L301 ceAbstractionStarter]: Result for error location Process2 was SAFE (2/5) [2021-06-06 03:03:07,524 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-06 03:03:07,531 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-06 03:03:07,532 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-06 03:03:07,532 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-06 03:03:07,532 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-06 03:03:07,532 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-06 03:03:07,532 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-06 03:03:07,532 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-06 03:03:07,532 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1======== [2021-06-06 03:03:07,697 INFO L301 ceAbstractionStarter]: Result for error location Process1 was SAFE (3/5) [2021-06-06 03:03:07,697 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-06 03:03:07,701 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-06 03:03:07,702 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-06 03:03:07,702 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-06 03:03:07,702 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-06 03:03:07,702 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-06 03:03:07,702 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-06 03:03:07,702 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-06 03:03:07,702 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-06 03:03:07,895 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (4/5) [2021-06-06 03:03:07,895 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-06-06 03:03:07,908 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-06 03:03:07,908 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-06 03:03:07,908 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-06 03:03:07,908 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-06 03:03:07,909 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-06 03:03:07,909 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-06 03:03:07,909 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-06 03:03:07,909 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1Thread1of1ForFork1======== Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-06 03:03:07,945 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:07,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:07,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1466776226, now seen corresponding path program 1 times [2021-06-06 03:03:07,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:07,946 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536189101] [2021-06-06 03:03:07,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:07,957 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-06 03:03:07,957 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:07,957 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536189101] [2021-06-06 03:03:07,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536189101] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 03:03:07,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 03:03:07,957 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-06 03:03:07,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231872053] [2021-06-06 03:03:07,958 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-06 03:03:07,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:07,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-06 03:03:07,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-06 03:03:07,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:07,958 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:07,959 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-06 03:03:07,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:07,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:07,971 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-06 03:03:07,971 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:07,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:07,972 INFO L82 PathProgramCache]: Analyzing trace with hash -326518399, now seen corresponding path program 1 times [2021-06-06 03:03:07,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:07,972 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788185169] [2021-06-06 03:03:07,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:07,992 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-06 03:03:07,992 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:07,992 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788185169] [2021-06-06 03:03:07,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788185169] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 03:03:07,993 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 03:03:07,993 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 03:03:07,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287355913] [2021-06-06 03:03:07,993 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 03:03:07,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:07,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 03:03:07,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 03:03:07,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:07,994 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:07,994 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-06 03:03:07,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:07,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,010 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-06 03:03:08,010 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:08,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:08,010 INFO L82 PathProgramCache]: Analyzing trace with hash 53415172, now seen corresponding path program 1 times [2021-06-06 03:03:08,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:08,010 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492287696] [2021-06-06 03:03:08,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:08,023 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-06 03:03:08,023 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:08,023 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492287696] [2021-06-06 03:03:08,023 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492287696] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 03:03:08,023 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 03:03:08,023 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-06 03:03:08,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18070521] [2021-06-06 03:03:08,024 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 03:03:08,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:08,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 03:03:08,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 03:03:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,027 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:08,027 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-06 03:03:08,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,097 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-06 03:03:08,098 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:08,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:08,098 INFO L82 PathProgramCache]: Analyzing trace with hash -792715866, now seen corresponding path program 1 times [2021-06-06 03:03:08,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:08,098 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785831587] [2021-06-06 03:03:08,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-06 03:03:08,111 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:08,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785831587] [2021-06-06 03:03:08,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785831587] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 03:03:08,113 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 03:03:08,113 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 03:03:08,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392068350] [2021-06-06 03:03:08,115 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 03:03:08,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:08,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 03:03:08,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 03:03:08,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,116 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:08,116 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-06 03:03:08,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,151 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-06 03:03:08,151 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:08,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:08,152 INFO L82 PathProgramCache]: Analyzing trace with hash 281650923, now seen corresponding path program 1 times [2021-06-06 03:03:08,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:08,152 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484224954] [2021-06-06 03:03:08,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-06-06 03:03:08,173 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:08,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484224954] [2021-06-06 03:03:08,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484224954] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 03:03:08,173 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 03:03:08,173 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 03:03:08,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659850261] [2021-06-06 03:03:08,174 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 03:03:08,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:08,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 03:03:08,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 03:03:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,174 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:08,175 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-06 03:03:08,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,209 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-06 03:03:08,209 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:08,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:08,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1830756149, now seen corresponding path program 1 times [2021-06-06 03:03:08,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:08,209 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938908334] [2021-06-06 03:03:08,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-06-06 03:03:08,229 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:08,229 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938908334] [2021-06-06 03:03:08,229 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938908334] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 03:03:08,229 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 03:03:08,229 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-06 03:03:08,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294064102] [2021-06-06 03:03:08,229 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-06 03:03:08,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:08,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-06 03:03:08,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-06 03:03:08,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,230 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:08,230 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-06 03:03:08,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:08,273 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-06 03:03:08,273 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:08,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:08,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1042805845, now seen corresponding path program 1 times [2021-06-06 03:03:08,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:08,274 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669069326] [2021-06-06 03:03:08,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-06 03:03:08,294 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:08,294 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669069326] [2021-06-06 03:03:08,294 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669069326] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 03:03:08,294 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 03:03:08,294 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-06 03:03:08,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494851968] [2021-06-06 03:03:08,295 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-06 03:03:08,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:08,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-06 03:03:08,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-06 03:03:08,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,295 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:08,296 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-06 03:03:08,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:08,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:08,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:08,377 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-06 03:03:08,377 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:08,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:08,378 INFO L82 PathProgramCache]: Analyzing trace with hash 660883402, now seen corresponding path program 2 times [2021-06-06 03:03:08,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:08,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844468020] [2021-06-06 03:03:08,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-06-06 03:03:08,393 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:08,393 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844468020] [2021-06-06 03:03:08,394 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844468020] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 03:03:08,394 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 03:03:08,394 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 03:03:08,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356641867] [2021-06-06 03:03:08,394 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 03:03:08,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:08,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 03:03:08,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 03:03:08,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,395 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:08,395 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-06 03:03:08,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:08,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:08,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:08,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,441 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-06 03:03:08,441 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:08,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:08,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1120876848, now seen corresponding path program 3 times [2021-06-06 03:03:08,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:08,442 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81535515] [2021-06-06 03:03:08,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 03:03:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 31 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-06 03:03:08,496 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 03:03:08,497 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81535515] [2021-06-06 03:03:08,497 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81535515] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-06 03:03:08,497 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496597963] [2021-06-06 03:03:08,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-06 03:03:08,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-06 03:03:08,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-06 03:03:08,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-06 03:03:08,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-06 03:03:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 31 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-06 03:03:08,668 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496597963] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-06 03:03:08,669 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-06 03:03:08,669 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2021-06-06 03:03:08,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601208847] [2021-06-06 03:03:08,669 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-06 03:03:08,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 03:03:08,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-06 03:03:08,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-06-06 03:03:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,670 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 03:03:08,670 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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-06 03:03:08,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:08,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:08,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:08,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:08,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 03:03:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 03:03:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 03:03:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-06 03:03:09,472 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-06 03:03:09,473 INFO L430 AbstractCegarLoop]: === Iteration 10 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 03:03:09,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 03:03:09,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1116071671, now seen corresponding path program 4 times [2021-06-06 03:03:09,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 03:03:09,474 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370923550] [2021-06-06 03:03:09,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 03:03:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-06 03:03:09,482 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-06 03:03:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-06 03:03:09,489 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-06 03:03:09,495 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-06 03:03:09,495 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-06 03:03:09,495 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-06 03:03:09,497 INFO L301 ceAbstractionStarter]: Result for error location Process1Thread1of1ForFork1 was UNSAFE (5/5) [2021-06-06 03:03:09,497 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-06 03:03:09,555 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.06 03:03:09 BasicIcfg [2021-06-06 03:03:09,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-06 03:03:09,555 INFO L168 Benchmark]: Toolchain (without parser) took 5971.64 ms. Allocated memory was 346.0 MB in the beginning and 480.2 MB in the end (delta: 134.2 MB). Free memory was 325.8 MB in the beginning and 338.0 MB in the end (delta: -12.1 MB). Peak memory consumption was 124.9 MB. Max. memory is 16.0 GB. [2021-06-06 03:03:09,556 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 ms. Allocated memory is still 346.0 MB. Free memory was 326.9 MB in the beginning and 326.9 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-06 03:03:09,556 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.32 ms. Allocated memory is still 346.0 MB. Free memory was 325.7 MB in the beginning and 324.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-06 03:03:09,556 INFO L168 Benchmark]: Boogie Preprocessor took 13.40 ms. Allocated memory is still 346.0 MB. Free memory was 324.3 MB in the beginning and 323.3 MB in the end (delta: 948.3 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-06 03:03:09,556 INFO L168 Benchmark]: RCFGBuilder took 222.04 ms. Allocated memory is still 346.0 MB. Free memory was 323.3 MB in the beginning and 310.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. [2021-06-06 03:03:09,556 INFO L168 Benchmark]: TraceAbstraction took 5711.78 ms. Allocated memory was 346.0 MB in the beginning and 480.2 MB in the end (delta: 134.2 MB). Free memory was 310.2 MB in the beginning and 338.0 MB in the end (delta: -27.8 MB). Peak memory consumption was 108.1 MB. Max. memory is 16.0 GB. [2021-06-06 03:03:09,556 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 346.0 MB. Free memory was 326.9 MB in the beginning and 326.9 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 20.32 ms. Allocated memory is still 346.0 MB. Free memory was 325.7 MB in the beginning and 324.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 13.40 ms. Allocated memory is still 346.0 MB. Free memory was 324.3 MB in the beginning and 323.3 MB in the end (delta: 948.3 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 222.04 ms. Allocated memory is still 346.0 MB. Free memory was 323.3 MB in the beginning and 310.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 5711.78 ms. Allocated memory was 346.0 MB in the beginning and 480.2 MB in the end (delta: 134.2 MB). Free memory was 310.2 MB in the beginning and 338.0 MB in the end (delta: -27.8 MB). Peak memory consumption was 108.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 17925, positive: 13126, positive conditional: 13126, positive unconditional: 0, negative: 4799, negative conditional: 4799, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 14504, positive: 13126, positive conditional: 13126, positive unconditional: 0, negative: 1378, negative conditional: 1378, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 14504, positive: 13061, positive conditional: 0, positive unconditional: 13061, negative: 1443, negative conditional: 0, negative unconditional: 1443, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 472, positive: 440, positive conditional: 0, positive unconditional: 440, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 472, positive: 420, positive conditional: 0, positive unconditional: 420, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 183, positive: 33, positive conditional: 13, positive unconditional: 20, negative: 150, negative conditional: 118, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 321, positive: 52, positive conditional: 18, positive unconditional: 34, negative: 268, negative conditional: 177, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14504, positive: 12621, positive conditional: 0, positive unconditional: 12621, negative: 1411, negative conditional: 0, negative unconditional: 1411, unknown: 472, unknown conditional: 0, unknown unconditional: 472] , Statistics on independence cache: Total cache size (in pairs): 603, Positive cache size: 453, Positive conditional cache size: 13, Positive unconditional cache size: 440, Negative cache size: 150, Negative conditional cache size: 118, Negative unconditional cache size: 32, SemanticConditionEliminator.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 183, positive: 33, positive conditional: 13, positive unconditional: 20, negative: 150, negative conditional: 118, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 321, positive: 52, positive conditional: 18, positive unconditional: 34, negative: 268, negative conditional: 177, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11451, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 11268, negative conditional: 1369, negative unconditional: 9899, unknown: 131, unknown conditional: 131, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 603, Positive cache size: 453, Positive conditional cache size: 13, Positive unconditional cache size: 440, Negative cache size: 150, Negative conditional cache size: 118, Negative unconditional cache size: 32, Eliminated conditions: 9899, SemanticConditionEliminator.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 183, positive: 33, positive conditional: 13, positive unconditional: 20, negative: 150, negative conditional: 118, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 321, positive: 52, positive conditional: 18, positive unconditional: 34, negative: 268, negative conditional: 177, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11451, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 11268, negative conditional: 1369, negative unconditional: 9899, unknown: 131, unknown conditional: 131, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 603, Positive cache size: 453, Positive conditional cache size: 13, Positive unconditional cache size: 440, Negative cache size: 150, Negative conditional cache size: 118, Negative unconditional cache size: 32, Eliminated conditions: 9899, SemanticConditionEliminator.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 183, positive: 33, positive conditional: 13, positive unconditional: 20, negative: 150, negative conditional: 118, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 321, positive: 52, positive conditional: 18, positive unconditional: 34, negative: 268, negative conditional: 177, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11451, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 11268, negative conditional: 1369, negative unconditional: 9899, unknown: 131, unknown conditional: 131, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 603, Positive cache size: 453, Positive conditional cache size: 13, Positive unconditional cache size: 440, Negative cache size: 150, Negative conditional cache size: 118, Negative unconditional cache size: 32, Eliminated conditions: 9899, SemanticConditionEliminator.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 183, positive: 33, positive conditional: 13, positive unconditional: 20, negative: 150, negative conditional: 118, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 321, positive: 52, positive conditional: 18, positive unconditional: 34, negative: 268, negative conditional: 177, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11451, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 11268, negative conditional: 1369, negative unconditional: 9899, unknown: 131, unknown conditional: 131, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 603, Positive cache size: 453, Positive conditional cache size: 13, Positive unconditional cache size: 440, Negative cache size: 150, Negative conditional cache size: 118, Negative unconditional cache size: 32, Eliminated conditions: 9899, SemanticConditionEliminator.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 183, positive: 33, positive conditional: 13, positive unconditional: 20, negative: 150, negative conditional: 118, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 321, positive: 52, positive conditional: 18, positive unconditional: 34, negative: 268, negative conditional: 177, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11451, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 11268, negative conditional: 1369, negative unconditional: 9899, unknown: 131, unknown conditional: 131, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 603, Positive cache size: 453, Positive conditional cache size: 13, Positive unconditional cache size: 440, Negative cache size: 150, Negative conditional cache size: 118, Negative unconditional cache size: 32, Eliminated conditions: 9899, SemanticConditionEliminator.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 183, positive: 33, positive conditional: 13, positive unconditional: 20, negative: 150, negative conditional: 118, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 321, positive: 52, positive conditional: 18, positive unconditional: 34, negative: 268, negative conditional: 177, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11451, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 11268, negative conditional: 1369, negative unconditional: 9899, unknown: 131, unknown conditional: 131, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 603, Positive cache size: 453, Positive conditional cache size: 13, Positive unconditional cache size: 440, Negative cache size: 150, Negative conditional cache size: 118, Negative unconditional cache size: 32, Eliminated conditions: 9899, SemanticConditionEliminator.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 183, positive: 33, positive conditional: 13, positive unconditional: 20, negative: 150, negative conditional: 118, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 321, positive: 52, positive conditional: 18, positive unconditional: 34, negative: 268, negative conditional: 177, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11451, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 11268, negative conditional: 1369, negative unconditional: 9899, unknown: 131, unknown conditional: 131, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 603, Positive cache size: 453, Positive conditional cache size: 13, Positive unconditional cache size: 440, Negative cache size: 150, Negative conditional cache size: 118, Negative unconditional cache size: 32, Eliminated conditions: 9899, SemanticConditionEliminator.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 183, positive: 33, positive conditional: 13, positive unconditional: 20, negative: 150, negative conditional: 118, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 321, positive: 52, positive conditional: 18, positive unconditional: 34, negative: 268, negative conditional: 177, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11451, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 11268, negative conditional: 1369, negative unconditional: 9899, unknown: 131, unknown conditional: 131, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 603, Positive cache size: 453, Positive conditional cache size: 13, Positive unconditional cache size: 440, Negative cache size: 150, Negative conditional cache size: 118, Negative unconditional cache size: 32, Eliminated conditions: 9899, SemanticConditionEliminator.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 183, positive: 33, positive conditional: 13, positive unconditional: 20, negative: 150, negative conditional: 118, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 321, positive: 52, positive conditional: 18, positive unconditional: 34, negative: 268, negative conditional: 177, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11451, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 11268, negative conditional: 1369, negative unconditional: 9899, unknown: 131, unknown conditional: 131, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 603, Positive cache size: 453, Positive conditional cache size: 13, Positive unconditional cache size: 440, Negative cache size: 150, Negative conditional cache size: 118, Negative unconditional cache size: 32, Eliminated conditions: 9899, SemanticConditionEliminator.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11451, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 11386, negative conditional: 1487, negative unconditional: 9899, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 183, positive: 33, positive conditional: 13, positive unconditional: 20, negative: 150, negative conditional: 118, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 321, positive: 52, positive conditional: 18, positive unconditional: 34, negative: 268, negative conditional: 177, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11451, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 11268, negative conditional: 1369, negative unconditional: 9899, unknown: 131, unknown conditional: 131, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 603, Positive cache size: 453, Positive conditional cache size: 13, Positive unconditional cache size: 440, Negative cache size: 150, Negative conditional cache size: 118, Negative unconditional cache size: 32, Eliminated conditions: 9899 ], Maximal queried relation: 10, Independence queries for same thread: 3421 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7870, positive: 6392, positive conditional: 6392, positive unconditional: 0, negative: 1478, negative conditional: 1478, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 6675, positive: 6392, positive conditional: 6392, positive unconditional: 0, negative: 283, negative conditional: 283, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 6675, positive: 6392, positive conditional: 0, positive unconditional: 6392, negative: 283, negative conditional: 0, negative unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 511, positive: 485, positive conditional: 0, positive unconditional: 485, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 511, positive: 466, positive conditional: 0, positive unconditional: 466, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 45, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6675, positive: 5907, positive conditional: 0, positive unconditional: 5907, negative: 257, negative conditional: 0, negative unconditional: 257, unknown: 511, unknown conditional: 0, unknown unconditional: 511] , Statistics on independence cache: Total cache size (in pairs): 511, Positive cache size: 485, Positive conditional cache size: 0, Positive unconditional cache size: 485, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 ], Maximal queried relation: 0, Independence queries for same thread: 1195 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7870, positive: 6392, positive conditional: 6392, positive unconditional: 0, negative: 1478, negative conditional: 1478, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 6675, positive: 6392, positive conditional: 6392, positive unconditional: 0, negative: 283, negative conditional: 283, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 6675, positive: 6392, positive conditional: 0, positive unconditional: 6392, negative: 283, negative conditional: 0, negative unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 511, positive: 485, positive conditional: 0, positive unconditional: 485, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 511, positive: 466, positive conditional: 0, positive unconditional: 466, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 45, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6675, positive: 5907, positive conditional: 0, positive unconditional: 5907, negative: 257, negative conditional: 0, negative unconditional: 257, unknown: 511, unknown conditional: 0, unknown unconditional: 511] , Statistics on independence cache: Total cache size (in pairs): 511, Positive cache size: 485, Positive conditional cache size: 0, Positive unconditional cache size: 485, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 ], Maximal queried relation: 0, Independence queries for same thread: 1195 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7870, positive: 6392, positive conditional: 6392, positive unconditional: 0, negative: 1478, negative conditional: 1478, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 6675, positive: 6392, positive conditional: 6392, positive unconditional: 0, negative: 283, negative conditional: 283, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 6675, positive: 6392, positive conditional: 0, positive unconditional: 6392, negative: 283, negative conditional: 0, negative unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 511, positive: 485, positive conditional: 0, positive unconditional: 485, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 511, positive: 466, positive conditional: 0, positive unconditional: 466, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 45, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6675, positive: 5907, positive conditional: 0, positive unconditional: 5907, negative: 257, negative conditional: 0, negative unconditional: 257, unknown: 511, unknown conditional: 0, unknown unconditional: 511] , Statistics on independence cache: Total cache size (in pairs): 511, Positive cache size: 485, Positive conditional cache size: 0, Positive unconditional cache size: 485, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 ], Maximal queried relation: 0, Independence queries for same thread: 1195 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 15768, positive: 11693, positive conditional: 11693, positive unconditional: 0, negative: 4075, negative conditional: 4075, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 12907, positive: 11693, positive conditional: 11693, positive unconditional: 0, negative: 1214, negative conditional: 1214, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 12907, positive: 11638, positive conditional: 0, positive unconditional: 11638, negative: 1269, negative conditional: 0, negative unconditional: 1269, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 526, positive: 489, positive conditional: 0, positive unconditional: 489, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 526, positive: 465, positive conditional: 0, positive unconditional: 465, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 41, positive conditional: 17, positive unconditional: 24, negative: 126, negative conditional: 89, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, positive: 52, positive conditional: 12, positive unconditional: 39, negative: 116, negative conditional: 88, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12907, positive: 11149, positive conditional: 0, positive unconditional: 11149, negative: 1232, negative conditional: 0, negative unconditional: 1232, unknown: 526, unknown conditional: 0, unknown unconditional: 526] , Statistics on independence cache: Total cache size (in pairs): 632, Positive cache size: 506, Positive conditional cache size: 17, Positive unconditional cache size: 489, Negative cache size: 126, Negative conditional cache size: 89, Negative unconditional cache size: 37, SemanticConditionEliminator.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 41, positive conditional: 17, positive unconditional: 24, negative: 126, negative conditional: 89, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, positive: 52, positive conditional: 12, positive unconditional: 39, negative: 116, negative conditional: 88, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8660, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 8516, negative conditional: 1153, negative unconditional: 7363, unknown: 106, unknown conditional: 106, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 632, Positive cache size: 506, Positive conditional cache size: 17, Positive unconditional cache size: 489, Negative cache size: 126, Negative conditional cache size: 89, Negative unconditional cache size: 37, Eliminated conditions: 7363, SemanticConditionEliminator.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 41, positive conditional: 17, positive unconditional: 24, negative: 126, negative conditional: 89, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, positive: 52, positive conditional: 12, positive unconditional: 39, negative: 116, negative conditional: 88, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8660, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 8516, negative conditional: 1153, negative unconditional: 7363, unknown: 106, unknown conditional: 106, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 632, Positive cache size: 506, Positive conditional cache size: 17, Positive unconditional cache size: 489, Negative cache size: 126, Negative conditional cache size: 89, Negative unconditional cache size: 37, Eliminated conditions: 7363, SemanticConditionEliminator.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 41, positive conditional: 17, positive unconditional: 24, negative: 126, negative conditional: 89, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, positive: 52, positive conditional: 12, positive unconditional: 39, negative: 116, negative conditional: 88, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8660, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 8516, negative conditional: 1153, negative unconditional: 7363, unknown: 106, unknown conditional: 106, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 632, Positive cache size: 506, Positive conditional cache size: 17, Positive unconditional cache size: 489, Negative cache size: 126, Negative conditional cache size: 89, Negative unconditional cache size: 37, Eliminated conditions: 7363, SemanticConditionEliminator.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 41, positive conditional: 17, positive unconditional: 24, negative: 126, negative conditional: 89, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, positive: 52, positive conditional: 12, positive unconditional: 39, negative: 116, negative conditional: 88, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8660, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 8516, negative conditional: 1153, negative unconditional: 7363, unknown: 106, unknown conditional: 106, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 632, Positive cache size: 506, Positive conditional cache size: 17, Positive unconditional cache size: 489, Negative cache size: 126, Negative conditional cache size: 89, Negative unconditional cache size: 37, Eliminated conditions: 7363, SemanticConditionEliminator.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 41, positive conditional: 17, positive unconditional: 24, negative: 126, negative conditional: 89, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, positive: 52, positive conditional: 12, positive unconditional: 39, negative: 116, negative conditional: 88, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8660, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 8516, negative conditional: 1153, negative unconditional: 7363, unknown: 106, unknown conditional: 106, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 632, Positive cache size: 506, Positive conditional cache size: 17, Positive unconditional cache size: 489, Negative cache size: 126, Negative conditional cache size: 89, Negative unconditional cache size: 37, Eliminated conditions: 7363, SemanticConditionEliminator.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 41, positive conditional: 17, positive unconditional: 24, negative: 126, negative conditional: 89, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, positive: 52, positive conditional: 12, positive unconditional: 39, negative: 116, negative conditional: 88, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8660, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 8516, negative conditional: 1153, negative unconditional: 7363, unknown: 106, unknown conditional: 106, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 632, Positive cache size: 506, Positive conditional cache size: 17, Positive unconditional cache size: 489, Negative cache size: 126, Negative conditional cache size: 89, Negative unconditional cache size: 37, Eliminated conditions: 7363, SemanticConditionEliminator.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 41, positive conditional: 17, positive unconditional: 24, negative: 126, negative conditional: 89, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, positive: 52, positive conditional: 12, positive unconditional: 39, negative: 116, negative conditional: 88, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8660, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 8516, negative conditional: 1153, negative unconditional: 7363, unknown: 106, unknown conditional: 106, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 632, Positive cache size: 506, Positive conditional cache size: 17, Positive unconditional cache size: 489, Negative cache size: 126, Negative conditional cache size: 89, Negative unconditional cache size: 37, Eliminated conditions: 7363, SemanticConditionEliminator.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 41, positive conditional: 17, positive unconditional: 24, negative: 126, negative conditional: 89, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, positive: 52, positive conditional: 12, positive unconditional: 39, negative: 116, negative conditional: 88, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8660, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 8516, negative conditional: 1153, negative unconditional: 7363, unknown: 106, unknown conditional: 106, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 632, Positive cache size: 506, Positive conditional cache size: 17, Positive unconditional cache size: 489, Negative cache size: 126, Negative conditional cache size: 89, Negative unconditional cache size: 37, Eliminated conditions: 7363, SemanticConditionEliminator.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8660, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 8605, negative conditional: 1242, negative unconditional: 7363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 167, positive: 41, positive conditional: 17, positive unconditional: 24, negative: 126, negative conditional: 89, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, positive: 52, positive conditional: 12, positive unconditional: 39, negative: 116, negative conditional: 88, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8660, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 8516, negative conditional: 1153, negative unconditional: 7363, unknown: 106, unknown conditional: 106, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 632, Positive cache size: 506, Positive conditional cache size: 17, Positive unconditional cache size: 489, Negative cache size: 126, Negative conditional cache size: 89, Negative unconditional cache size: 37, Eliminated conditions: 7363 ], Maximal queried relation: 9, Independence queries for same thread: 2861 - 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] [L36] FORK 0 fork 2 Process2(); VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=3, critical=0, deadline=4, deadline=2, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=3, critical=0, deadline=4, deadline=2, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=3, critical=0, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=3, critical=0, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=3, critical=0, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=0, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=4, critical=0, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=4, critical=0, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=4, critical=0, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=4, critical=2, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=4, critical=0, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=4, critical=0, deadline=4, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=4, critical=0, deadline=4, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=4, critical=0, deadline=5, deadline=2, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=4, critical=0, deadline=5, deadline=2, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=4, critical=0, deadline=5, deadline=2, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=4, critical=0, deadline=5, deadline=2, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=4, critical=0, deadline=5, deadline=2, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=4, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=5, critical=2, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=5, critical=0, deadline=6, deadline=5, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=5, critical=0, deadline=6, deadline=5, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=5, critical=0, deadline=6, deadline=5, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=5, critical=0, deadline=6, deadline=5, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=5, critical=0, deadline=6, deadline=5, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=6, critical=0, deadline=7, deadline=6, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=6, critical=0, deadline=7, deadline=6, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=6, critical=1, deadline=7, deadline=6, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=6, critical=0, deadline=7, deadline=6, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=7, critical=0, deadline=7, deadline=6, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=7, critical=0, deadline=7, deadline=6, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=7, critical=0, deadline=7, deadline=6, delay=1, lock=2, wait=1] [L69] 2 lock := 0; VAL [clk=7, critical=0, deadline=7, deadline=6, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=7, critical=0, deadline=7, deadline=6, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; 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=7, deadline=8, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=8, critical=1, deadline=7, deadline=8, delay=1, lock=1, wait=1] [L87] 3 assert critical == 0; VAL [clk=8, critical=1, deadline=7, deadline=8, delay=1, lock=1, 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] [L36] FORK 0 fork 2 Process2(); VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=1, critical=0, deadline=2, deadline=2, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=1, critical=0, deadline=2, deadline=2, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=1, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=1, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=2, critical=2, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=2, critical=0, deadline=3, deadline=2, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=2, critical=0, deadline=3, deadline=2, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=2, critical=0, deadline=3, deadline=2, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=2, critical=0, deadline=3, deadline=2, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=2, critical=0, deadline=3, deadline=2, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=2, critical=0, deadline=3, deadline=3, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=3, critical=0, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=3, critical=0, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=3, critical=1, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=3, critical=0, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=0, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=4, critical=0, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=4, critical=0, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=4, critical=0, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=4, critical=2, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=4, critical=0, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=4, critical=0, deadline=4, deadline=3, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=4, critical=0, deadline=4, deadline=3, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=4, critical=0, deadline=5, deadline=3, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=4, critical=0, deadline=5, deadline=3, delay=1, lock=0, wait=1] [L69] 2 lock := 0; VAL [clk=4, critical=0, deadline=5, deadline=3, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=4, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=4, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=4, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=4, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=5, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=5, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=5, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=5, critical=2, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=5, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=5, critical=0, deadline=5, deadline=3, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=5, critical=0, deadline=5, deadline=3, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=5, critical=0, deadline=6, deadline=3, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=6, critical=1, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; 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] [L81] 3 lock := 2; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; 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] [L60] 2 lock := 1; VAL [clk=7, critical=2, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=7, critical=2, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=7, critical=2, deadline=7, deadline=8, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=8, critical=2, deadline=7, deadline=8, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=8, critical=2, deadline=7, deadline=8, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=8, critical=2, deadline=7, deadline=8, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=8, critical=2, deadline=7, deadline=8, delay=1, lock=1, 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: 3390.2ms, OverallIterations: 11, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.3ms, PartialOrderReductionTime: 1947.1ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 61, 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: 32.1ms SsaConstructionTime, 133.2ms SatisfiabilityAnalysisTime, 732.6ms InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 541 ConstructedInterpolants, 0 QuantifiedInterpolants, 1097 SizeOfPredicates, 3 NumberOfNonLiveVariables, 119 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 323/355 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: 206.5ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.0ms, PartialOrderReductionTime: 196.1ms, 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: 172.5ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.0ms, PartialOrderReductionTime: 163.2ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 197.1ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.9ms, PartialOrderReductionTime: 191.5ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process1Thread1of1ForFork1 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1600.9ms, OverallIterations: 10, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.9ms, PartialOrderReductionTime: 948.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 12.2ms SsaConstructionTime, 49.8ms SatisfiabilityAnalysisTime, 267.3ms InterpolantComputationTime, 625 NumberOfCodeBlocks, 625 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 1118 SizeOfPredicates, 4 NumberOfNonLiveVariables, 119 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 283/319 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...