/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-Random521.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 20:12:06,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-06 20:12:06,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-06 20:12:07,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-06 20:12:07,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-06 20:12:07,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-06 20:12:07,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-06 20:12:07,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-06 20:12:07,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-06 20:12:07,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-06 20:12:07,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-06 20:12:07,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-06 20:12:07,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-06 20:12:07,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-06 20:12:07,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-06 20:12:07,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-06 20:12:07,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-06 20:12:07,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-06 20:12:07,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-06 20:12:07,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-06 20:12:07,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-06 20:12:07,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-06 20:12:07,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-06 20:12:07,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-06 20:12:07,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-06 20:12:07,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-06 20:12:07,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-06 20:12:07,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-06 20:12:07,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-06 20:12:07,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-06 20:12:07,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-06 20:12:07,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-06 20:12:07,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-06 20:12:07,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-06 20:12:07,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-06 20:12:07,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-06 20:12:07,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-06 20:12:07,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-06 20:12:07,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-06 20:12:07,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-06 20:12:07,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-06 20:12:07,057 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-Random521.epf [2021-06-06 20:12:07,094 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-06 20:12:07,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-06 20:12:07,095 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-06 20:12:07,095 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-06 20:12:07,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-06 20:12:07,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-06 20:12:07,098 INFO L138 SettingsManager]: * Use SBE=true [2021-06-06 20:12:07,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-06 20:12:07,098 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-06 20:12:07,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-06 20:12:07,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-06 20:12:07,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-06 20:12:07,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-06 20:12:07,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-06 20:12:07,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-06 20:12:07,100 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-06 20:12:07,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-06 20:12:07,100 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-06 20:12:07,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-06 20:12:07,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-06 20:12:07,100 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-06 20:12:07,100 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-06 20:12:07,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-06 20:12:07,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-06 20:12:07,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-06 20:12:07,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-06 20:12:07,101 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-06 20:12:07,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-06 20:12:07,101 INFO L138 SettingsManager]: * DFS Order used in POR=RANDOM [2021-06-06 20:12:07,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-06 20:12:07,101 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-06 20:12:07,102 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-06-06 20:12:07,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-06 20:12:07,102 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-06-06 20:12:07,102 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-06 20:12:07,102 INFO L138 SettingsManager]: * Random seed used by POR DFS order=521 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 20:12:07,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-06 20:12:07,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-06 20:12:07,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-06 20:12:07,458 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-06 20:12:07,459 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-06 20:12:07,460 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 20:12:07,461 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2021-06-06 20:12:07,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-06 20:12:07,492 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-06 20:12:07,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-06 20:12:07,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-06 20:12:07,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-06 20:12:07,501 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 08:12:07" (1/1) ... [2021-06-06 20:12:07,508 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 08:12:07" (1/1) ... [2021-06-06 20:12:07,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-06 20:12:07,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-06 20:12:07,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-06 20:12:07,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-06 20:12:07,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 08:12:07" (1/1) ... [2021-06-06 20:12:07,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 08:12:07" (1/1) ... [2021-06-06 20:12:07,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 08:12:07" (1/1) ... [2021-06-06 20:12:07,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 08:12:07" (1/1) ... [2021-06-06 20:12:07,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 08:12:07" (1/1) ... [2021-06-06 20:12:07,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 08:12:07" (1/1) ... [2021-06-06 20:12:07,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 08:12:07" (1/1) ... [2021-06-06 20:12:07,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-06 20:12:07,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-06 20:12:07,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-06 20:12:07,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-06 20:12:07,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 08:12:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-06 20:12:07,610 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2021-06-06 20:12:07,610 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2021-06-06 20:12:07,610 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2021-06-06 20:12:07,611 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2021-06-06 20:12:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2021-06-06 20:12:07,611 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2021-06-06 20:12:07,611 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-06 20:12:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-06 20:12:07,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-06 20:12:07,612 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2021-06-06 20:12:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2021-06-06 20:12:07,612 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2021-06-06 20:12:07,612 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 20:12:07,802 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-06 20:12:07,803 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-06-06 20:12:07,806 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.06 08:12:07 BoogieIcfgContainer [2021-06-06 20:12:07,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-06 20:12:07,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-06 20:12:07,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-06 20:12:07,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-06 20:12:07,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 08:12:07" (1/2) ... [2021-06-06 20:12:07,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@880f1bb and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.06 08:12:07, skipping insertion in model container [2021-06-06 20:12:07,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.06 08:12:07" (2/2) ... [2021-06-06 20:12:07,812 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2021-06-06 20:12:07,831 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-06 20:12:07,831 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-06 20:12:07,831 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-06 20:12:07,832 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-06 20:12:07,878 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,878 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,879 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,879 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,880 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,880 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,880 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,880 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,881 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,882 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,882 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,883 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,883 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,883 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,883 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,884 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,902 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,904 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 20:12:07,905 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-06 20:12:07,926 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 20:12:07,969 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-06 20:12:07,969 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-06 20:12:07,969 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-06 20:12:07,969 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-06 20:12:07,970 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-06 20:12:07,970 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-06 20:12:07,970 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-06 20:12:07,970 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2Thread1of1ForFork2======== [2021-06-06 20:12:08,033 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 20:12:08,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 20:12:08,037 INFO L82 PathProgramCache]: Analyzing trace with hash 385128237, now seen corresponding path program 1 times [2021-06-06 20:12:08,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 20:12:08,045 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204405844] [2021-06-06 20:12:08,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 20:12:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 20:12:08,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-06 20:12:08,180 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 20:12:08,180 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204405844] [2021-06-06 20:12:08,182 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204405844] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 20:12:08,182 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 20:12:08,182 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-06 20:12:08,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121379169] [2021-06-06 20:12:08,187 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-06 20:12:08,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 20:12:08,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-06 20:12:08,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-06 20:12:08,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,206 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 20:12:08,215 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 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 20:12:08,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,243 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-06 20:12:08,244 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 20:12:08,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 20:12:08,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1344854396, now seen corresponding path program 1 times [2021-06-06 20:12:08,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 20:12:08,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693139081] [2021-06-06 20:12:08,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 20:12:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 20:12:08,311 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 20:12:08,312 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 20:12:08,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693139081] [2021-06-06 20:12:08,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693139081] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 20:12:08,312 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 20:12:08,312 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 20:12:08,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414839027] [2021-06-06 20:12:08,314 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 20:12:08,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 20:12:08,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 20:12:08,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 20:12:08,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,315 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 20:12:08,315 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 20:12:08,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,453 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-06 20:12:08,453 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 20:12:08,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 20:12:08,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1771558050, now seen corresponding path program 1 times [2021-06-06 20:12:08,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 20:12:08,454 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734803508] [2021-06-06 20:12:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 20:12:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 20:12:08,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-06 20:12:08,485 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 20:12:08,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734803508] [2021-06-06 20:12:08,486 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734803508] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 20:12:08,487 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 20:12:08,487 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 20:12:08,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795185588] [2021-06-06 20:12:08,488 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 20:12:08,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 20:12:08,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 20:12:08,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 20:12:08,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,493 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 20:12:08,493 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-06 20:12:08,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,558 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-06 20:12:08,559 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 20:12:08,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 20:12:08,561 INFO L82 PathProgramCache]: Analyzing trace with hash -653406331, now seen corresponding path program 1 times [2021-06-06 20:12:08,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 20:12:08,561 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350760251] [2021-06-06 20:12:08,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 20:12:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 20:12:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-06 20:12:08,613 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 20:12:08,613 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350760251] [2021-06-06 20:12:08,613 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350760251] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 20:12:08,613 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 20:12:08,614 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-06 20:12:08,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691132506] [2021-06-06 20:12:08,615 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 20:12:08,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 20:12:08,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 20:12:08,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 20:12:08,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,619 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 20:12:08,619 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-06 20:12:08,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,729 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-06 20:12:08,730 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 20:12:08,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 20:12:08,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1196328904, now seen corresponding path program 1 times [2021-06-06 20:12:08,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 20:12:08,730 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310555530] [2021-06-06 20:12:08,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 20:12:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 20:12:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-06 20:12:08,820 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 20:12:08,820 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310555530] [2021-06-06 20:12:08,820 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310555530] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 20:12:08,820 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 20:12:08,820 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-06 20:12:08,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190266526] [2021-06-06 20:12:08,821 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-06 20:12:08,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 20:12:08,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-06 20:12:08,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-06 20:12:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,822 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 20:12:08,822 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 20:12:08,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 20:12:08,915 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-06 20:12:08,915 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 20:12:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 20:12:08,916 INFO L82 PathProgramCache]: Analyzing trace with hash 333604220, now seen corresponding path program 1 times [2021-06-06 20:12:08,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 20:12:08,916 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435756864] [2021-06-06 20:12:08,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 20:12:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 20:12:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-06 20:12:08,991 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 20:12:08,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435756864] [2021-06-06 20:12:08,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435756864] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 20:12:08,995 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 20:12:08,995 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-06 20:12:08,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696662636] [2021-06-06 20:12:08,995 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-06 20:12:08,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 20:12:08,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-06 20:12:08,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-06 20:12:08,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,997 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 20:12:08,997 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-06 20:12:08,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:08,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:08,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-06 20:12:08,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:09,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:09,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 20:12:09,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 20:12:09,087 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-06 20:12:09,087 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 20:12:09,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 20:12:09,088 INFO L82 PathProgramCache]: Analyzing trace with hash 776623784, now seen corresponding path program 2 times [2021-06-06 20:12:09,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 20:12:09,088 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054590101] [2021-06-06 20:12:09,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 20:12:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 20:12:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-06 20:12:09,142 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 20:12:09,142 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054590101] [2021-06-06 20:12:09,142 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054590101] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 20:12:09,143 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 20:12:09,143 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 20:12:09,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649052279] [2021-06-06 20:12:09,144 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 20:12:09,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 20:12:09,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 20:12:09,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 20:12:09,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:09,145 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 20:12:09,145 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 20:12:09,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:09,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:09,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:09,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:09,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-06 20:12:09,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-06 20:12:09,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 20:12:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 20:12:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:09,229 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-06 20:12:09,229 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 20:12:09,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 20:12:09,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1343809824, now seen corresponding path program 3 times [2021-06-06 20:12:09,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 20:12:09,233 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530358123] [2021-06-06 20:12:09,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 20:12:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-06 20:12:09,253 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-06 20:12:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-06 20:12:09,269 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-06 20:12:09,291 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-06 20:12:09,292 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-06 20:12:09,292 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-06 20:12:09,306 INFO L301 ceAbstractionStarter]: Result for error location Process2Thread1of1ForFork2 was UNSAFE (1/5) [2021-06-06 20:12:09,309 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-06 20:12:09,316 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-06 20:12:09,316 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-06 20:12:09,316 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-06 20:12:09,316 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-06 20:12:09,316 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-06 20:12:09,317 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-06 20:12:09,317 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-06 20:12:09,317 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2======== [2021-06-06 20:12:09,544 INFO L301 ceAbstractionStarter]: Result for error location Process2 was SAFE (2/5) [2021-06-06 20:12:09,545 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 20:12:09,556 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-06 20:12:09,556 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-06 20:12:09,556 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-06 20:12:09,557 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-06 20:12:09,557 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-06 20:12:09,557 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-06 20:12:09,557 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-06 20:12:09,557 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1======== Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-06 20:12:09,732 INFO L301 ceAbstractionStarter]: Result for error location Process1 was SAFE (3/5) [2021-06-06 20:12:09,732 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-06 20:12:09,746 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-06 20:12:09,746 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-06 20:12:09,746 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-06 20:12:09,746 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-06 20:12:09,746 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-06 20:12:09,746 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-06 20:12:09,746 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-06 20:12:09,747 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-06 20:12:09,931 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (4/5) [2021-06-06 20:12:09,932 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-06-06 20:12:09,961 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-06 20:12:09,962 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-06 20:12:09,962 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-06 20:12:09,962 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-06 20:12:09,962 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-06 20:12:09,962 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-06 20:12:09,962 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-06 20:12:09,962 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1Thread1of1ForFork1======== Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-06 20:12:09,965 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 20:12:09,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 20:12:09,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2010602468, now seen corresponding path program 1 times [2021-06-06 20:12:09,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 20:12:09,965 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900189000] [2021-06-06 20:12:09,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 20:12:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 20:12:09,971 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 20:12:09,971 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 20:12:09,971 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900189000] [2021-06-06 20:12:09,971 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900189000] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 20:12:09,972 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 20:12:09,972 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-06 20:12:09,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685709315] [2021-06-06 20:12:09,972 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-06 20:12:09,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 20:12:09,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-06 20:12:09,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-06 20:12:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:09,973 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 20:12:09,973 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 20:12:09,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:09,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:09,974 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-06 20:12:09,974 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 20:12:09,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 20:12:09,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1128325677, now seen corresponding path program 1 times [2021-06-06 20:12:09,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 20:12:09,975 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371442923] [2021-06-06 20:12:09,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 20:12:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 20:12:09,982 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 20:12:09,982 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 20:12:09,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371442923] [2021-06-06 20:12:09,983 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371442923] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 20:12:09,983 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 20:12:09,983 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-06 20:12:09,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840454917] [2021-06-06 20:12:09,983 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 20:12:09,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 20:12:09,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 20:12:09,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 20:12:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:09,984 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 20:12:09,984 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-06 20:12:09,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:09,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,063 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-06 20:12:10,063 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 20:12:10,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 20:12:10,063 INFO L82 PathProgramCache]: Analyzing trace with hash -961001691, now seen corresponding path program 1 times [2021-06-06 20:12:10,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 20:12:10,063 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075093517] [2021-06-06 20:12:10,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 20:12:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 20:12:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-06 20:12:10,074 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 20:12:10,074 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075093517] [2021-06-06 20:12:10,074 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075093517] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 20:12:10,074 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 20:12:10,075 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 20:12:10,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476687105] [2021-06-06 20:12:10,075 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 20:12:10,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 20:12:10,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 20:12:10,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 20:12:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,076 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 20:12:10,076 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 20:12:10,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,104 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-06 20:12:10,104 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 20:12:10,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 20:12:10,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1694472692, now seen corresponding path program 1 times [2021-06-06 20:12:10,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 20:12:10,105 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4428210] [2021-06-06 20:12:10,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 20:12:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 20:12:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-06 20:12:10,117 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 20:12:10,117 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4428210] [2021-06-06 20:12:10,117 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4428210] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 20:12:10,117 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 20:12:10,118 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 20:12:10,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374555520] [2021-06-06 20:12:10,118 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 20:12:10,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 20:12:10,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 20:12:10,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 20:12:10,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,119 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 20:12:10,119 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-06 20:12:10,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,161 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-06 20:12:10,161 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 20:12:10,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 20:12:10,161 INFO L82 PathProgramCache]: Analyzing trace with hash -998161276, now seen corresponding path program 2 times [2021-06-06 20:12:10,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 20:12:10,162 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000024020] [2021-06-06 20:12:10,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 20:12:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 20:12:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-06 20:12:10,181 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 20:12:10,181 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000024020] [2021-06-06 20:12:10,181 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000024020] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 20:12:10,182 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 20:12:10,182 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-06 20:12:10,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282232739] [2021-06-06 20:12:10,182 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-06 20:12:10,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 20:12:10,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-06 20:12:10,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-06 20:12:10,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,183 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 20:12:10,183 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 20:12:10,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 20:12:10,233 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-06 20:12:10,233 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 20:12:10,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 20:12:10,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1599002484, now seen corresponding path program 1 times [2021-06-06 20:12:10,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 20:12:10,234 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229210774] [2021-06-06 20:12:10,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 20:12:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 20:12:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-06 20:12:10,255 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 20:12:10,255 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229210774] [2021-06-06 20:12:10,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229210774] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 20:12:10,255 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 20:12:10,255 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-06 20:12:10,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313563988] [2021-06-06 20:12:10,256 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-06 20:12:10,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 20:12:10,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-06 20:12:10,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-06 20:12:10,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,257 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 20:12:10,257 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-06 20:12:10,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-06 20:12:10,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 20:12:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 20:12:10,307 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-06 20:12:10,307 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 20:12:10,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 20:12:10,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1304520562, now seen corresponding path program 2 times [2021-06-06 20:12:10,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 20:12:10,308 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427665740] [2021-06-06 20:12:10,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 20:12:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 20:12:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-06 20:12:10,323 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 20:12:10,323 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427665740] [2021-06-06 20:12:10,323 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427665740] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 20:12:10,323 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 20:12:10,323 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 20:12:10,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240772897] [2021-06-06 20:12:10,323 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 20:12:10,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 20:12:10,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 20:12:10,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 20:12:10,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,324 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 20:12:10,324 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 20:12:10,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-06 20:12:10,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-06 20:12:10,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 20:12:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 20:12:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 20:12:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 20:12:10,374 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-06 20:12:10,374 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 20:12:10,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 20:12:10,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2067910960, now seen corresponding path program 3 times [2021-06-06 20:12:10,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 20:12:10,375 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046361341] [2021-06-06 20:12:10,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 20:12:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-06 20:12:10,381 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-06 20:12:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-06 20:12:10,385 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-06 20:12:10,389 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-06 20:12:10,390 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-06 20:12:10,390 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-06 20:12:10,392 INFO L301 ceAbstractionStarter]: Result for error location Process1Thread1of1ForFork1 was UNSAFE (5/5) [2021-06-06 20:12:10,392 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-06 20:12:10,491 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.06 08:12:10 BasicIcfg [2021-06-06 20:12:10,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-06 20:12:10,492 INFO L168 Benchmark]: Toolchain (without parser) took 3000.32 ms. Allocated memory was 392.2 MB in the beginning and 524.3 MB in the end (delta: 132.1 MB). Free memory was 373.2 MB in the beginning and 489.7 MB in the end (delta: -116.5 MB). Peak memory consumption was 126.5 MB. Max. memory is 16.0 GB. [2021-06-06 20:12:10,492 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 392.2 MB. Free memory is still 374.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-06 20:12:10,493 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.79 ms. Allocated memory is still 392.2 MB. Free memory was 373.1 MB in the beginning and 371.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-06 20:12:10,493 INFO L168 Benchmark]: Boogie Preprocessor took 15.50 ms. Allocated memory is still 392.2 MB. Free memory was 371.6 MB in the beginning and 370.7 MB in the end (delta: 912.6 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-06 20:12:10,493 INFO L168 Benchmark]: RCFGBuilder took 274.03 ms. Allocated memory is still 392.2 MB. Free memory was 370.6 MB in the beginning and 357.8 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. [2021-06-06 20:12:10,493 INFO L168 Benchmark]: TraceAbstraction took 2683.77 ms. Allocated memory was 392.2 MB in the beginning and 524.3 MB in the end (delta: 132.1 MB). Free memory was 357.4 MB in the beginning and 489.7 MB in the end (delta: -132.3 MB). Peak memory consumption was 109.7 MB. Max. memory is 16.0 GB. [2021-06-06 20:12:10,494 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.16 ms. Allocated memory is still 392.2 MB. Free memory is still 374.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 21.79 ms. Allocated memory is still 392.2 MB. Free memory was 373.1 MB in the beginning and 371.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 15.50 ms. Allocated memory is still 392.2 MB. Free memory was 371.6 MB in the beginning and 370.7 MB in the end (delta: 912.6 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 274.03 ms. Allocated memory is still 392.2 MB. Free memory was 370.6 MB in the beginning and 357.8 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 2683.77 ms. Allocated memory was 392.2 MB in the beginning and 524.3 MB in the end (delta: 132.1 MB). Free memory was 357.4 MB in the beginning and 489.7 MB in the end (delta: -132.3 MB). Peak memory consumption was 109.7 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: 5540, positive: 4278, positive conditional: 4278, positive unconditional: 0, negative: 1262, negative conditional: 1262, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 4694, positive: 4278, positive conditional: 4278, positive unconditional: 0, negative: 416, negative conditional: 416, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 4694, positive: 4273, positive conditional: 0, positive unconditional: 4273, negative: 421, negative conditional: 0, negative unconditional: 421, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 431, positive: 404, positive conditional: 0, positive unconditional: 404, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 431, positive: 383, positive conditional: 0, positive unconditional: 383, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, positive: 24, positive conditional: 3, positive unconditional: 21, negative: 55, negative conditional: 28, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 193, positive: 50, positive conditional: 4, positive unconditional: 46, negative: 143, negative conditional: 64, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4694, positive: 3869, positive conditional: 0, positive unconditional: 3869, negative: 394, negative conditional: 0, negative unconditional: 394, unknown: 431, unknown conditional: 0, unknown unconditional: 431] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 407, Positive conditional cache size: 3, Positive unconditional cache size: 404, Negative cache size: 55, Negative conditional cache size: 28, Negative unconditional cache size: 27, SemanticConditionEliminator.Independence Queries: [ total: 2211, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 2206, negative conditional: 200, negative unconditional: 2006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2211, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 2206, negative conditional: 200, negative unconditional: 2006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, positive: 24, positive conditional: 3, positive unconditional: 21, negative: 55, negative conditional: 28, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 193, positive: 50, positive conditional: 4, positive unconditional: 46, negative: 143, negative conditional: 64, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2211, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2178, negative conditional: 172, negative unconditional: 2006, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 407, Positive conditional cache size: 3, Positive unconditional cache size: 404, Negative cache size: 55, Negative conditional cache size: 28, Negative unconditional cache size: 27, Eliminated conditions: 2006, SemanticConditionEliminator.Independence Queries: [ total: 2211, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 2206, negative conditional: 200, negative unconditional: 2006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2211, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 2206, negative conditional: 200, negative unconditional: 2006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, positive: 24, positive conditional: 3, positive unconditional: 21, negative: 55, negative conditional: 28, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 193, positive: 50, positive conditional: 4, positive unconditional: 46, negative: 143, negative conditional: 64, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2211, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2178, negative conditional: 172, negative unconditional: 2006, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 407, Positive conditional cache size: 3, Positive unconditional cache size: 404, Negative cache size: 55, Negative conditional cache size: 28, Negative unconditional cache size: 27, Eliminated conditions: 2006, SemanticConditionEliminator.Independence Queries: [ total: 2211, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 2206, negative conditional: 200, negative unconditional: 2006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2211, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 2206, negative conditional: 200, negative unconditional: 2006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, positive: 24, positive conditional: 3, positive unconditional: 21, negative: 55, negative conditional: 28, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 193, positive: 50, positive conditional: 4, positive unconditional: 46, negative: 143, negative conditional: 64, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2211, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2178, negative conditional: 172, negative unconditional: 2006, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 407, Positive conditional cache size: 3, Positive unconditional cache size: 404, Negative cache size: 55, Negative conditional cache size: 28, Negative unconditional cache size: 27, Eliminated conditions: 2006, SemanticConditionEliminator.Independence Queries: [ total: 2211, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 2206, negative conditional: 200, negative unconditional: 2006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2211, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 2206, negative conditional: 200, negative unconditional: 2006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, positive: 24, positive conditional: 3, positive unconditional: 21, negative: 55, negative conditional: 28, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 193, positive: 50, positive conditional: 4, positive unconditional: 46, negative: 143, negative conditional: 64, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2211, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2178, negative conditional: 172, negative unconditional: 2006, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 407, Positive conditional cache size: 3, Positive unconditional cache size: 404, Negative cache size: 55, Negative conditional cache size: 28, Negative unconditional cache size: 27, Eliminated conditions: 2006, SemanticConditionEliminator.Independence Queries: [ total: 2211, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 2206, negative conditional: 200, negative unconditional: 2006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2211, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 2206, negative conditional: 200, negative unconditional: 2006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, positive: 24, positive conditional: 3, positive unconditional: 21, negative: 55, negative conditional: 28, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 193, positive: 50, positive conditional: 4, positive unconditional: 46, negative: 143, negative conditional: 64, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2211, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2178, negative conditional: 172, negative unconditional: 2006, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 407, Positive conditional cache size: 3, Positive unconditional cache size: 404, Negative cache size: 55, Negative conditional cache size: 28, Negative unconditional cache size: 27, Eliminated conditions: 2006, SemanticConditionEliminator.Independence Queries: [ total: 2211, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 2206, negative conditional: 200, negative unconditional: 2006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2211, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 2206, negative conditional: 200, negative unconditional: 2006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, positive: 24, positive conditional: 3, positive unconditional: 21, negative: 55, negative conditional: 28, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 193, positive: 50, positive conditional: 4, positive unconditional: 46, negative: 143, negative conditional: 64, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2211, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2178, negative conditional: 172, negative unconditional: 2006, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 407, Positive conditional cache size: 3, Positive unconditional cache size: 404, Negative cache size: 55, Negative conditional cache size: 28, Negative unconditional cache size: 27, Eliminated conditions: 2006, SemanticConditionEliminator.Independence Queries: [ total: 2211, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 2206, negative conditional: 200, negative unconditional: 2006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2211, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 2206, negative conditional: 200, negative unconditional: 2006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, positive: 24, positive conditional: 3, positive unconditional: 21, negative: 55, negative conditional: 28, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 193, positive: 50, positive conditional: 4, positive unconditional: 46, negative: 143, negative conditional: 64, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2211, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2178, negative conditional: 172, negative unconditional: 2006, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 407, Positive conditional cache size: 3, Positive unconditional cache size: 404, Negative cache size: 55, Negative conditional cache size: 28, Negative unconditional cache size: 27, Eliminated conditions: 2006 ], Maximal queried relation: 7, Independence queries for same thread: 846 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7427, positive: 6095, positive conditional: 6095, positive unconditional: 0, negative: 1332, negative conditional: 1332, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 6388, positive: 6095, positive conditional: 6095, positive unconditional: 0, negative: 293, negative conditional: 293, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 6388, positive: 6095, positive conditional: 0, positive unconditional: 6095, negative: 293, negative conditional: 0, negative unconditional: 293, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 653, positive: 619, positive conditional: 0, positive unconditional: 619, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 653, positive: 595, positive conditional: 0, positive unconditional: 595, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 58, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6388, positive: 5476, positive conditional: 0, positive unconditional: 5476, negative: 259, negative conditional: 0, negative unconditional: 259, unknown: 653, unknown conditional: 0, unknown unconditional: 653] , Statistics on independence cache: Total cache size (in pairs): 653, Positive cache size: 619, Positive conditional cache size: 0, Positive unconditional cache size: 619, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 ], Maximal queried relation: 0, Independence queries for same thread: 1039 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7427, positive: 6095, positive conditional: 6095, positive unconditional: 0, negative: 1332, negative conditional: 1332, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 6388, positive: 6095, positive conditional: 6095, positive unconditional: 0, negative: 293, negative conditional: 293, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 6388, positive: 6095, positive conditional: 0, positive unconditional: 6095, negative: 293, negative conditional: 0, negative unconditional: 293, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 653, positive: 619, positive conditional: 0, positive unconditional: 619, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 653, positive: 595, positive conditional: 0, positive unconditional: 595, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 58, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 66, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6388, positive: 5476, positive conditional: 0, positive unconditional: 5476, negative: 259, negative conditional: 0, negative unconditional: 259, unknown: 653, unknown conditional: 0, unknown unconditional: 653] , Statistics on independence cache: Total cache size (in pairs): 653, Positive cache size: 619, Positive conditional cache size: 0, Positive unconditional cache size: 619, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 ], Maximal queried relation: 0, Independence queries for same thread: 1039 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7427, positive: 6095, positive conditional: 6095, positive unconditional: 0, negative: 1332, negative conditional: 1332, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 6388, positive: 6095, positive conditional: 6095, positive unconditional: 0, negative: 293, negative conditional: 293, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 6388, positive: 6095, positive conditional: 0, positive unconditional: 6095, negative: 293, negative conditional: 0, negative unconditional: 293, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 653, positive: 619, positive conditional: 0, positive unconditional: 619, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 653, positive: 595, positive conditional: 0, positive unconditional: 595, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 58, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6388, positive: 5476, positive conditional: 0, positive unconditional: 5476, negative: 259, negative conditional: 0, negative unconditional: 259, unknown: 653, unknown conditional: 0, unknown unconditional: 653] , Statistics on independence cache: Total cache size (in pairs): 653, Positive cache size: 619, Positive conditional cache size: 0, Positive unconditional cache size: 619, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 ], Maximal queried relation: 0, Independence queries for same thread: 1039 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7688, positive: 5955, positive conditional: 5955, positive unconditional: 0, negative: 1733, negative conditional: 1733, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 6538, positive: 5955, positive conditional: 5955, positive unconditional: 0, negative: 583, negative conditional: 583, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 6538, positive: 5935, positive conditional: 0, positive unconditional: 5935, negative: 603, negative conditional: 0, negative unconditional: 603, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 500, positive: 467, positive conditional: 0, positive unconditional: 467, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 500, positive: 442, positive conditional: 0, positive unconditional: 442, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 95, positive: 32, positive conditional: 7, positive unconditional: 25, negative: 63, negative conditional: 30, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, positive: 41, positive conditional: 4, positive unconditional: 37, negative: 51, negative conditional: 26, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6538, positive: 5468, positive conditional: 0, positive unconditional: 5468, negative: 570, negative conditional: 0, negative unconditional: 570, unknown: 500, unknown conditional: 0, unknown unconditional: 500] , Statistics on independence cache: Total cache size (in pairs): 537, Positive cache size: 474, Positive conditional cache size: 7, Positive unconditional cache size: 467, Negative cache size: 63, Negative conditional cache size: 30, Negative unconditional cache size: 33, SemanticConditionEliminator.Independence Queries: [ total: 2962, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 2942, negative conditional: 241, negative unconditional: 2701, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2962, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 2942, negative conditional: 241, negative unconditional: 2701, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 95, positive: 32, positive conditional: 7, positive unconditional: 25, negative: 63, negative conditional: 30, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, positive: 41, positive conditional: 4, positive unconditional: 37, negative: 51, negative conditional: 26, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2962, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 2912, negative conditional: 211, negative unconditional: 2701, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 537, Positive cache size: 474, Positive conditional cache size: 7, Positive unconditional cache size: 467, Negative cache size: 63, Negative conditional cache size: 30, Negative unconditional cache size: 33, Eliminated conditions: 2701, SemanticConditionEliminator.Independence Queries: [ total: 2962, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 2942, negative conditional: 241, negative unconditional: 2701, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2962, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 2942, negative conditional: 241, negative unconditional: 2701, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 95, positive: 32, positive conditional: 7, positive unconditional: 25, negative: 63, negative conditional: 30, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, positive: 41, positive conditional: 4, positive unconditional: 37, negative: 51, negative conditional: 26, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2962, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 2912, negative conditional: 211, negative unconditional: 2701, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 537, Positive cache size: 474, Positive conditional cache size: 7, Positive unconditional cache size: 467, Negative cache size: 63, Negative conditional cache size: 30, Negative unconditional cache size: 33, Eliminated conditions: 2701, SemanticConditionEliminator.Independence Queries: [ total: 2962, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 2942, negative conditional: 241, negative unconditional: 2701, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2962, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 2942, negative conditional: 241, negative unconditional: 2701, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 95, positive: 32, positive conditional: 7, positive unconditional: 25, negative: 63, negative conditional: 30, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, positive: 41, positive conditional: 4, positive unconditional: 37, negative: 51, negative conditional: 26, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2962, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 2912, negative conditional: 211, negative unconditional: 2701, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 537, Positive cache size: 474, Positive conditional cache size: 7, Positive unconditional cache size: 467, Negative cache size: 63, Negative conditional cache size: 30, Negative unconditional cache size: 33, Eliminated conditions: 2701, SemanticConditionEliminator.Independence Queries: [ total: 2962, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 2942, negative conditional: 241, negative unconditional: 2701, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2962, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 2942, negative conditional: 241, negative unconditional: 2701, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 95, positive: 32, positive conditional: 7, positive unconditional: 25, negative: 63, negative conditional: 30, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, positive: 41, positive conditional: 4, positive unconditional: 37, negative: 51, negative conditional: 26, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2962, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 2912, negative conditional: 211, negative unconditional: 2701, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 537, Positive cache size: 474, Positive conditional cache size: 7, Positive unconditional cache size: 467, Negative cache size: 63, Negative conditional cache size: 30, Negative unconditional cache size: 33, Eliminated conditions: 2701, SemanticConditionEliminator.Independence Queries: [ total: 2962, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 2942, negative conditional: 241, negative unconditional: 2701, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2962, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 2942, negative conditional: 241, negative unconditional: 2701, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 95, positive: 32, positive conditional: 7, positive unconditional: 25, negative: 63, negative conditional: 30, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, positive: 41, positive conditional: 4, positive unconditional: 37, negative: 51, negative conditional: 26, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2962, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 2912, negative conditional: 211, negative unconditional: 2701, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 537, Positive cache size: 474, Positive conditional cache size: 7, Positive unconditional cache size: 467, Negative cache size: 63, Negative conditional cache size: 30, Negative unconditional cache size: 33, Eliminated conditions: 2701, SemanticConditionEliminator.Independence Queries: [ total: 2962, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 2942, negative conditional: 241, negative unconditional: 2701, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2962, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 2942, negative conditional: 241, negative unconditional: 2701, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 95, positive: 32, positive conditional: 7, positive unconditional: 25, negative: 63, negative conditional: 30, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, positive: 41, positive conditional: 4, positive unconditional: 37, negative: 51, negative conditional: 26, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2962, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 2912, negative conditional: 211, negative unconditional: 2701, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 537, Positive cache size: 474, Positive conditional cache size: 7, Positive unconditional cache size: 467, Negative cache size: 63, Negative conditional cache size: 30, Negative unconditional cache size: 33, Eliminated conditions: 2701, SemanticConditionEliminator.Independence Queries: [ total: 2962, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 2942, negative conditional: 241, negative unconditional: 2701, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2962, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 2942, negative conditional: 241, negative unconditional: 2701, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 95, positive: 32, positive conditional: 7, positive unconditional: 25, negative: 63, negative conditional: 30, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, positive: 41, positive conditional: 4, positive unconditional: 37, negative: 51, negative conditional: 26, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2962, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 2912, negative conditional: 211, negative unconditional: 2701, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 537, Positive cache size: 474, Positive conditional cache size: 7, Positive unconditional cache size: 467, Negative cache size: 63, Negative conditional cache size: 30, Negative unconditional cache size: 33, Eliminated conditions: 2701 ], Maximal queried relation: 7, Independence queries for same thread: 1150 - CounterExampleResult [Line: 87]: assertion can be violated assertion can be violated We found a FailurePath: [L28] 0 critical := 0; VAL [critical=0] [L29] 0 clk := 0; VAL [clk=0, critical=0] [L30] 0 assume wait >= 1; VAL [clk=0, critical=0, wait=1] [L33] 0 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK 0 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK 0 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L57] COND FALSE 2 !(lock != 1) VAL [clk=0, critical=0, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=0, critical=0, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=0, critical=1, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=0, critical=0, delay=1, lock=1, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=0, critical=0, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L87] 3 assert critical == 0; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=2, critical=1, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L88] 3 critical := 2; VAL [clk=2, critical=2, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=2, critical=2, deadline=3, deadline=1, delay=1, lock=0, wait=1] [L89] 3 critical := 0; VAL [clk=2, critical=0, deadline=3, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=2, critical=0, deadline=3, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=2, critical=0, deadline=3, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=2, critical=0, deadline=3, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=2, critical=0, deadline=3, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=3, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=3, critical=0, deadline=3, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=3, critical=0, deadline=3, deadline=1, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=3, critical=0, deadline=3, deadline=1, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=3, critical=0, deadline=3, deadline=1, delay=1, lock=0, wait=1] [L66] 2 assert critical == 0; VAL [clk=3, critical=0, deadline=3, deadline=1, delay=1, lock=0, wait=1] [L67] 2 critical := 1; VAL [clk=3, critical=1, deadline=3, deadline=1, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=3, critical=1, deadline=3, deadline=4, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=3, critical=1, deadline=3, deadline=4, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=3, critical=1, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=3, critical=1, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=3, critical=1, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=1, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=4, critical=1, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=4, critical=1, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=4, critical=1, deadline=3, deadline=4, delay=1, lock=2, wait=1] - CounterExampleResult [Line: 66]: assertion can be violated assertion can be violated We found a FailurePath: [L28] 0 critical := 0; VAL [critical=0] [L29] 0 clk := 0; VAL [clk=0, critical=0] [L30] 0 assume wait >= 1; VAL [clk=0, critical=0, wait=1] [L33] 0 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK 0 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK 0 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L57] COND FALSE 2 !(lock != 1) VAL [clk=0, critical=0, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=0, critical=0, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=0, critical=1, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=0, critical=0, delay=1, lock=1, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=0, critical=0, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L87] 3 assert critical == 0; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=2, critical=1, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L88] 3 critical := 2; VAL [clk=2, critical=2, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=2, critical=2, deadline=3, deadline=1, delay=1, lock=0, wait=1] [L89] 3 critical := 0; VAL [clk=2, critical=0, deadline=3, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=2, critical=0, deadline=3, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=2, critical=0, deadline=3, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=2, critical=0, deadline=3, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=2, critical=0, deadline=3, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=3, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=3, critical=0, deadline=3, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=3, critical=0, deadline=3, deadline=1, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=3, critical=0, deadline=3, deadline=1, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=3, critical=0, deadline=3, deadline=1, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=3, critical=0, deadline=3, deadline=4, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=3, critical=0, deadline=3, deadline=4, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=3, critical=0, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=3, critical=0, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=3, critical=0, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=0, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=4, critical=0, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=4, critical=0, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=4, critical=0, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=4, critical=2, deadline=3, deadline=4, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=4, critical=2, deadline=3, deadline=4, delay=1, lock=2, wait=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process2Thread1of1ForFork2 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1364.3ms, OverallIterations: 8, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11.3ms, PartialOrderReductionTime: 652.3ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 22, 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.7ms SsaConstructionTime, 127.8ms SatisfiabilityAnalysisTime, 266.5ms InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 95/95 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: 233.5ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.4ms, PartialOrderReductionTime: 224.7ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process1 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 186.3ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.1ms, PartialOrderReductionTime: 173.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: 198.1ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.9ms, PartialOrderReductionTime: 183.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: Process1Thread1of1ForFork1 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 459.2ms, OverallIterations: 8, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.1ms, PartialOrderReductionTime: 297.1ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 22, 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: 4.3ms SsaConstructionTime, 15.7ms SatisfiabilityAnalysisTime, 65.0ms InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 415 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 128/128 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...