/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-Random42.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 14:42:45,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-06 14:42:45,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-06 14:42:45,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-06 14:42:45,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-06 14:42:45,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-06 14:42:45,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-06 14:42:45,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-06 14:42:45,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-06 14:42:45,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-06 14:42:45,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-06 14:42:45,647 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-06 14:42:45,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-06 14:42:45,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-06 14:42:45,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-06 14:42:45,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-06 14:42:45,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-06 14:42:45,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-06 14:42:45,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-06 14:42:45,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-06 14:42:45,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-06 14:42:45,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-06 14:42:45,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-06 14:42:45,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-06 14:42:45,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-06 14:42:45,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-06 14:42:45,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-06 14:42:45,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-06 14:42:45,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-06 14:42:45,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-06 14:42:45,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-06 14:42:45,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-06 14:42:45,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-06 14:42:45,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-06 14:42:45,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-06 14:42:45,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-06 14:42:45,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-06 14:42:45,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-06 14:42:45,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-06 14:42:45,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-06 14:42:45,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-06 14:42:45,684 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-Random42.epf [2021-06-06 14:42:45,704 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-06 14:42:45,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-06 14:42:45,705 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-06 14:42:45,705 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-06 14:42:45,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-06 14:42:45,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-06 14:42:45,706 INFO L138 SettingsManager]: * Use SBE=true [2021-06-06 14:42:45,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-06 14:42:45,707 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-06 14:42:45,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-06 14:42:45,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-06 14:42:45,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-06 14:42:45,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-06 14:42:45,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-06 14:42:45,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-06 14:42:45,708 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-06 14:42:45,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-06 14:42:45,708 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-06 14:42:45,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-06 14:42:45,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-06 14:42:45,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-06 14:42:45,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-06 14:42:45,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-06 14:42:45,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-06 14:42:45,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-06 14:42:45,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-06 14:42:45,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-06 14:42:45,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-06 14:42:45,710 INFO L138 SettingsManager]: * DFS Order used in POR=RANDOM [2021-06-06 14:42:45,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-06 14:42:45,710 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-06 14:42:45,710 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-06-06 14:42:45,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-06 14:42:45,711 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-06-06 14:42:45,711 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-06 14:42:45,711 INFO L138 SettingsManager]: * Random seed used by POR DFS order=42 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 14:42:46,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-06 14:42:46,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-06 14:42:46,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-06 14:42:46,069 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-06 14:42:46,070 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-06 14:42:46,071 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 14:42:46,071 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2021-06-06 14:42:46,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-06 14:42:46,095 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-06 14:42:46,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-06 14:42:46,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-06 14:42:46,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-06 14:42:46,106 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 02:42:46" (1/1) ... [2021-06-06 14:42:46,112 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 02:42:46" (1/1) ... [2021-06-06 14:42:46,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-06 14:42:46,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-06 14:42:46,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-06 14:42:46,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-06 14:42:46,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 02:42:46" (1/1) ... [2021-06-06 14:42:46,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 02:42:46" (1/1) ... [2021-06-06 14:42:46,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 02:42:46" (1/1) ... [2021-06-06 14:42:46,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 02:42:46" (1/1) ... [2021-06-06 14:42:46,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 02:42:46" (1/1) ... [2021-06-06 14:42:46,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 02:42:46" (1/1) ... [2021-06-06 14:42:46,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 02:42:46" (1/1) ... [2021-06-06 14:42:46,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-06 14:42:46,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-06 14:42:46,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-06 14:42:46,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-06 14:42:46,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 02:42:46" (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 14:42:46,196 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2021-06-06 14:42:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2021-06-06 14:42:46,196 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2021-06-06 14:42:46,196 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2021-06-06 14:42:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2021-06-06 14:42:46,197 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2021-06-06 14:42:46,197 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-06 14:42:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-06 14:42:46,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-06 14:42:46,197 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2021-06-06 14:42:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2021-06-06 14:42:46,197 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2021-06-06 14:42:46,198 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 14:42:46,385 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-06 14:42:46,385 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-06-06 14:42:46,386 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.06 02:42:46 BoogieIcfgContainer [2021-06-06 14:42:46,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-06 14:42:46,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-06 14:42:46,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-06 14:42:46,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-06 14:42:46,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 02:42:46" (1/2) ... [2021-06-06 14:42:46,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77cc35be and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.06 02:42:46, skipping insertion in model container [2021-06-06 14:42:46,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.06 02:42:46" (2/2) ... [2021-06-06 14:42:46,407 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2021-06-06 14:42:46,412 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-06 14:42:46,412 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-06 14:42:46,412 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-06 14:42:46,413 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-06 14:42:46,432 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,432 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,433 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,433 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,434 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,434 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,434 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,434 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,435 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,435 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,436 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,436 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,437 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,437 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,437 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,437 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,442 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,444 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-06 14:42:46,445 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-06 14:42:46,473 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 14:42:46,562 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-06 14:42:46,562 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-06 14:42:46,562 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-06 14:42:46,562 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-06 14:42:46,563 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-06 14:42:46,563 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-06 14:42:46,563 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-06 14:42:46,563 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2Thread1of1ForFork2======== [2021-06-06 14:42:46,700 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:46,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:46,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2105290949, now seen corresponding path program 1 times [2021-06-06 14:42:46,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:46,717 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180031887] [2021-06-06 14:42:46,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 14:42:46,826 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 14:42:46,826 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 14:42:46,827 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180031887] [2021-06-06 14:42:46,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180031887] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 14:42:46,828 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 14:42:46,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-06 14:42:46,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384540343] [2021-06-06 14:42:46,832 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-06 14:42:46,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 14:42:46,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-06 14:42:46,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-06 14:42:46,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:46,852 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 14:42:46,856 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 14:42:46,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:46,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:46,914 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-06 14:42:46,914 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:46,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:46,915 INFO L82 PathProgramCache]: Analyzing trace with hash 759260898, now seen corresponding path program 1 times [2021-06-06 14:42:46,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:46,915 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188796956] [2021-06-06 14:42:46,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 14:42:46,967 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 14:42:46,967 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 14:42:46,967 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188796956] [2021-06-06 14:42:46,967 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188796956] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 14:42:46,967 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 14:42:46,967 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 14:42:46,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271688314] [2021-06-06 14:42:46,969 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 14:42:46,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 14:42:46,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 14:42:46,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 14:42:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:46,971 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 14:42:46,972 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 14:42:46,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:46,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,002 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-06 14:42:47,002 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:47,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:47,003 INFO L82 PathProgramCache]: Analyzing trace with hash 215888270, now seen corresponding path program 1 times [2021-06-06 14:42:47,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:47,003 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417931968] [2021-06-06 14:42:47,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 14:42:47,042 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 14:42:47,043 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 14:42:47,043 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417931968] [2021-06-06 14:42:47,044 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417931968] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 14:42:47,045 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 14:42:47,045 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-06 14:42:47,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177263130] [2021-06-06 14:42:47,046 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 14:42:47,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 14:42:47,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 14:42:47,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 14:42:47,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,049 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 14:42:47,049 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-06 14:42:47,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,159 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-06 14:42:47,159 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:47,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:47,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2094467836, now seen corresponding path program 1 times [2021-06-06 14:42:47,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:47,160 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671505494] [2021-06-06 14:42:47,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 14:42:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-06 14:42:47,226 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 14:42:47,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671505494] [2021-06-06 14:42:47,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671505494] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 14:42:47,226 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 14:42:47,227 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 14:42:47,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374728515] [2021-06-06 14:42:47,227 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 14:42:47,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 14:42:47,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 14:42:47,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 14:42:47,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,228 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 14:42:47,228 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-06 14:42:47,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,313 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-06 14:42:47,313 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:47,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:47,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1376664023, now seen corresponding path program 1 times [2021-06-06 14:42:47,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:47,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757174794] [2021-06-06 14:42:47,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 14:42:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-06 14:42:47,362 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 14:42:47,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757174794] [2021-06-06 14:42:47,363 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757174794] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 14:42:47,363 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 14:42:47,363 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 14:42:47,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171483434] [2021-06-06 14:42:47,363 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 14:42:47,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 14:42:47,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 14:42:47,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 14:42:47,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,364 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 14:42:47,365 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 14:42:47,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,423 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-06 14:42:47,423 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:47,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:47,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1766495353, now seen corresponding path program 1 times [2021-06-06 14:42:47,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:47,424 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112152235] [2021-06-06 14:42:47,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 14:42:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-06 14:42:47,446 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 14:42:47,446 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112152235] [2021-06-06 14:42:47,446 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112152235] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 14:42:47,446 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 14:42:47,446 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 14:42:47,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239852803] [2021-06-06 14:42:47,447 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 14:42:47,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 14:42:47,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 14:42:47,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 14:42:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,448 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 14:42:47,448 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 14:42:47,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,504 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-06 14:42:47,504 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:47,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash -22930965, now seen corresponding path program 1 times [2021-06-06 14:42:47,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:47,505 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241598201] [2021-06-06 14:42:47,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 14:42:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-06 14:42:47,532 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 14:42:47,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241598201] [2021-06-06 14:42:47,532 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241598201] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 14:42:47,533 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 14:42:47,533 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-06 14:42:47,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516791425] [2021-06-06 14:42:47,533 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-06 14:42:47,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 14:42:47,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-06 14:42:47,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-06 14:42:47,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,534 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 14:42:47,534 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-06 14:42:47,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 14:42:47,591 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-06 14:42:47,591 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:47,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:47,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1713126223, now seen corresponding path program 1 times [2021-06-06 14:42:47,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:47,592 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081395005] [2021-06-06 14:42:47,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 14:42:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-06 14:42:47,618 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 14:42:47,618 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081395005] [2021-06-06 14:42:47,618 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081395005] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 14:42:47,618 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 14:42:47,618 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-06 14:42:47,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491583247] [2021-06-06 14:42:47,619 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-06 14:42:47,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 14:42:47,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-06 14:42:47,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-06 14:42:47,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,620 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 14:42:47,620 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-06 14:42:47,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-06 14:42:47,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:47,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:47,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 14:42:47,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 14:42:47,676 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-06 14:42:47,677 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:47,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:47,677 INFO L82 PathProgramCache]: Analyzing trace with hash 624711000, now seen corresponding path program 2 times [2021-06-06 14:42:47,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:47,677 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949286939] [2021-06-06 14:42:47,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-06 14:42:47,685 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-06 14:42:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-06 14:42:47,691 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-06 14:42:47,706 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-06 14:42:47,706 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-06 14:42:47,706 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-06 14:42:47,713 INFO L301 ceAbstractionStarter]: Result for error location Process2Thread1of1ForFork2 was UNSAFE (1/5) [2021-06-06 14:42:47,715 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 14:42:47,724 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-06 14:42:47,724 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-06 14:42:47,724 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-06 14:42:47,725 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-06 14:42:47,725 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-06 14:42:47,725 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-06 14:42:47,725 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-06 14:42:47,725 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2======== [2021-06-06 14:42:47,972 INFO L301 ceAbstractionStarter]: Result for error location Process2 was SAFE (2/5) [2021-06-06 14:42:47,973 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-06 14:42:47,980 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-06 14:42:47,980 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-06 14:42:47,980 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-06 14:42:47,980 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-06 14:42:47,980 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-06 14:42:47,981 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-06 14:42:47,981 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-06 14:42:47,981 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1======== [2021-06-06 14:42:48,140 INFO L301 ceAbstractionStarter]: Result for error location Process1 was SAFE (3/5) [2021-06-06 14:42:48,140 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-06-06 14:42:48,152 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-06 14:42:48,152 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-06 14:42:48,152 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-06 14:42:48,152 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-06 14:42:48,152 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-06 14:42:48,153 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-06 14:42:48,153 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-06 14:42:48,153 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-06 14:42:48,310 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (4/5) [2021-06-06 14:42:48,311 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 14:42:48,324 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-06 14:42:48,324 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-06 14:42:48,324 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-06 14:42:48,324 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-06 14:42:48,325 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-06 14:42:48,325 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-06 14:42:48,325 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-06 14:42:48,325 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 14:42:48,342 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:48,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:48,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1140894659, now seen corresponding path program 1 times [2021-06-06 14:42:48,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:48,342 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547980099] [2021-06-06 14:42:48,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 14:42:48,349 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 14:42:48,349 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 14:42:48,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547980099] [2021-06-06 14:42:48,349 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547980099] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 14:42:48,350 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 14:42:48,350 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-06 14:42:48,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103976769] [2021-06-06 14:42:48,350 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-06 14:42:48,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 14:42:48,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-06 14:42:48,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-06 14:42:48,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,351 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 14:42:48,351 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-06 14:42:48,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,361 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-06 14:42:48,362 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:48,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:48,362 INFO L82 PathProgramCache]: Analyzing trace with hash 345555014, now seen corresponding path program 1 times [2021-06-06 14:42:48,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:48,362 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492927061] [2021-06-06 14:42:48,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 14:42:48,373 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 14:42:48,374 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 14:42:48,374 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492927061] [2021-06-06 14:42:48,374 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492927061] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 14:42:48,374 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 14:42:48,374 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 14:42:48,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485769518] [2021-06-06 14:42:48,374 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 14:42:48,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 14:42:48,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 14:42:48,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 14:42:48,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,375 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 14:42:48,375 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:42:48,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,390 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-06 14:42:48,390 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:48,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1595883809, now seen corresponding path program 1 times [2021-06-06 14:42:48,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:48,391 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314529274] [2021-06-06 14:42:48,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 14:42:48,404 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 14:42:48,404 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 14:42:48,404 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314529274] [2021-06-06 14:42:48,405 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314529274] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 14:42:48,405 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 14:42:48,405 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-06 14:42:48,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952693172] [2021-06-06 14:42:48,405 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 14:42:48,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 14:42:48,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 14:42:48,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 14:42:48,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,406 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 14:42:48,406 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 14:42:48,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,446 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-06 14:42:48,446 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:48,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:48,447 INFO L82 PathProgramCache]: Analyzing trace with hash -230412007, now seen corresponding path program 1 times [2021-06-06 14:42:48,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:48,447 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018221630] [2021-06-06 14:42:48,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 14:42:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-06 14:42:48,464 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 14:42:48,464 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018221630] [2021-06-06 14:42:48,464 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018221630] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 14:42:48,464 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 14:42:48,465 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 14:42:48,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465137254] [2021-06-06 14:42:48,465 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 14:42:48,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 14:42:48,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 14:42:48,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 14:42:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,466 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 14:42:48,466 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 14:42:48,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,514 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-06 14:42:48,514 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:48,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:48,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1366767847, now seen corresponding path program 1 times [2021-06-06 14:42:48,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:48,515 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594900155] [2021-06-06 14:42:48,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 14:42:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-06 14:42:48,531 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 14:42:48,531 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594900155] [2021-06-06 14:42:48,531 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594900155] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 14:42:48,531 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 14:42:48,531 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 14:42:48,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264975014] [2021-06-06 14:42:48,532 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 14:42:48,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 14:42:48,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 14:42:48,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 14:42:48,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,533 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 14:42:48,533 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 14:42:48,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,585 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-06 14:42:48,585 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:48,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:48,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1568327725, now seen corresponding path program 2 times [2021-06-06 14:42:48,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:48,586 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582380418] [2021-06-06 14:42:48,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 14:42:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-06 14:42:48,599 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 14:42:48,599 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582380418] [2021-06-06 14:42:48,599 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582380418] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 14:42:48,600 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 14:42:48,600 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-06 14:42:48,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495992882] [2021-06-06 14:42:48,600 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-06 14:42:48,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 14:42:48,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-06 14:42:48,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-06 14:42:48,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,601 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 14:42:48,601 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 14:42:48,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,649 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-06 14:42:48,649 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:48,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:48,649 INFO L82 PathProgramCache]: Analyzing trace with hash 175236663, now seen corresponding path program 2 times [2021-06-06 14:42:48,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:48,650 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764878318] [2021-06-06 14:42:48,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 14:42:48,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-06 14:42:48,666 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 14:42:48,667 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764878318] [2021-06-06 14:42:48,667 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764878318] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 14:42:48,667 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 14:42:48,667 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-06 14:42:48,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363955013] [2021-06-06 14:42:48,667 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-06 14:42:48,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 14:42:48,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-06 14:42:48,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-06 14:42:48,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,668 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 14:42:48,668 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 14:42:48,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 14:42:48,724 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-06 14:42:48,724 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:48,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:48,725 INFO L82 PathProgramCache]: Analyzing trace with hash -219480481, now seen corresponding path program 1 times [2021-06-06 14:42:48,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:48,725 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335238232] [2021-06-06 14:42:48,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-06 14:42:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-06 14:42:48,744 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-06 14:42:48,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335238232] [2021-06-06 14:42:48,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335238232] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-06 14:42:48,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-06 14:42:48,745 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-06 14:42:48,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033451870] [2021-06-06 14:42:48,745 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-06 14:42:48,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-06 14:42:48,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-06 14:42:48,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-06 14:42:48,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,769 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-06 14:42:48,769 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 14:42:48,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-06 14:42:48,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-06 14:42:48,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-06 14:42:48,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 14:42:48,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-06 14:42:48,824 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-06 14:42:48,824 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-06 14:42:48,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-06 14:42:48,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1307895704, now seen corresponding path program 2 times [2021-06-06 14:42:48,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-06 14:42:48,824 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570007300] [2021-06-06 14:42:48,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-06 14:42:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-06 14:42:48,829 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-06 14:42:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-06 14:42:48,832 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-06 14:42:48,835 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-06 14:42:48,835 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-06 14:42:48,835 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-06 14:42:48,837 INFO L301 ceAbstractionStarter]: Result for error location Process1Thread1of1ForFork1 was UNSAFE (5/5) [2021-06-06 14:42:48,837 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-06 14:42:48,859 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.06 02:42:48 BasicIcfg [2021-06-06 14:42:48,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-06 14:42:48,860 INFO L168 Benchmark]: Toolchain (without parser) took 2765.63 ms. Allocated memory is still 356.5 MB. Free memory was 336.1 MB in the beginning and 304.8 MB in the end (delta: 31.3 MB). Peak memory consumption was 33.4 MB. Max. memory is 16.0 GB. [2021-06-06 14:42:48,861 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 356.5 MB. Free memory was 337.3 MB in the beginning and 337.2 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-06 14:42:48,861 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.73 ms. Allocated memory is still 356.5 MB. Free memory was 336.1 MB in the beginning and 334.6 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-06 14:42:48,861 INFO L168 Benchmark]: Boogie Preprocessor took 13.57 ms. Allocated memory is still 356.5 MB. Free memory was 334.6 MB in the beginning and 333.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-06 14:42:48,861 INFO L168 Benchmark]: RCFGBuilder took 251.61 ms. Allocated memory is still 356.5 MB. Free memory was 333.6 MB in the beginning and 321.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. [2021-06-06 14:42:48,861 INFO L168 Benchmark]: TraceAbstraction took 2471.73 ms. Allocated memory is still 356.5 MB. Free memory was 320.7 MB in the beginning and 304.8 MB in the end (delta: 15.9 MB). Peak memory consumption was 16.7 MB. Max. memory is 16.0 GB. [2021-06-06 14:42:48,862 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.15 ms. Allocated memory is still 356.5 MB. Free memory was 337.3 MB in the beginning and 337.2 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 23.73 ms. Allocated memory is still 356.5 MB. Free memory was 336.1 MB in the beginning and 334.6 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 13.57 ms. Allocated memory is still 356.5 MB. Free memory was 334.6 MB in the beginning and 333.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 251.61 ms. Allocated memory is still 356.5 MB. Free memory was 333.6 MB in the beginning and 321.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 2471.73 ms. Allocated memory is still 356.5 MB. Free memory was 320.7 MB in the beginning and 304.8 MB in the end (delta: 15.9 MB). Peak memory consumption was 16.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: 6896, positive: 5473, positive conditional: 5473, positive unconditional: 0, negative: 1423, negative conditional: 1423, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 5975, positive: 5473, positive conditional: 5473, positive unconditional: 0, negative: 502, negative conditional: 502, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 5975, positive: 5447, positive conditional: 0, positive unconditional: 5447, negative: 528, negative conditional: 0, negative unconditional: 528, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 438, positive: 414, positive conditional: 0, positive unconditional: 414, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 438, positive: 399, positive conditional: 0, positive unconditional: 399, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, positive: 23, positive conditional: 8, positive unconditional: 15, negative: 47, negative conditional: 23, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 180, positive: 44, positive conditional: 10, positive unconditional: 34, negative: 137, negative conditional: 32, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5975, positive: 5033, positive conditional: 0, positive unconditional: 5033, negative: 504, negative conditional: 0, negative unconditional: 504, unknown: 438, unknown conditional: 0, unknown unconditional: 438] , Statistics on independence cache: Total cache size (in pairs): 469, Positive cache size: 422, Positive conditional cache size: 8, Positive unconditional cache size: 414, Negative cache size: 47, Negative conditional cache size: 23, Negative unconditional cache size: 24, SemanticConditionEliminator.Independence Queries: [ total: 2987, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 2961, negative conditional: 146, negative unconditional: 2815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2987, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 2961, negative conditional: 146, negative unconditional: 2815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, positive: 23, positive conditional: 8, positive unconditional: 15, negative: 47, negative conditional: 23, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 180, positive: 44, positive conditional: 10, positive unconditional: 34, negative: 137, negative conditional: 32, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2987, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 2938, negative conditional: 123, negative unconditional: 2815, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 469, Positive cache size: 422, Positive conditional cache size: 8, Positive unconditional cache size: 414, Negative cache size: 47, Negative conditional cache size: 23, Negative unconditional cache size: 24, Eliminated conditions: 2815, SemanticConditionEliminator.Independence Queries: [ total: 2987, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 2961, negative conditional: 146, negative unconditional: 2815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2987, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 2961, negative conditional: 146, negative unconditional: 2815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, positive: 23, positive conditional: 8, positive unconditional: 15, negative: 47, negative conditional: 23, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 180, positive: 44, positive conditional: 10, positive unconditional: 34, negative: 137, negative conditional: 32, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2987, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 2938, negative conditional: 123, negative unconditional: 2815, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 469, Positive cache size: 422, Positive conditional cache size: 8, Positive unconditional cache size: 414, Negative cache size: 47, Negative conditional cache size: 23, Negative unconditional cache size: 24, Eliminated conditions: 2815, SemanticConditionEliminator.Independence Queries: [ total: 2987, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 2961, negative conditional: 146, negative unconditional: 2815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2987, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 2961, negative conditional: 146, negative unconditional: 2815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, positive: 23, positive conditional: 8, positive unconditional: 15, negative: 47, negative conditional: 23, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 180, positive: 44, positive conditional: 10, positive unconditional: 34, negative: 137, negative conditional: 32, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2987, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 2938, negative conditional: 123, negative unconditional: 2815, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 469, Positive cache size: 422, Positive conditional cache size: 8, Positive unconditional cache size: 414, Negative cache size: 47, Negative conditional cache size: 23, Negative unconditional cache size: 24, Eliminated conditions: 2815, SemanticConditionEliminator.Independence Queries: [ total: 2987, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 2961, negative conditional: 146, negative unconditional: 2815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2987, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 2961, negative conditional: 146, negative unconditional: 2815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, positive: 23, positive conditional: 8, positive unconditional: 15, negative: 47, negative conditional: 23, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 180, positive: 44, positive conditional: 10, positive unconditional: 34, negative: 137, negative conditional: 32, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2987, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 2938, negative conditional: 123, negative unconditional: 2815, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 469, Positive cache size: 422, Positive conditional cache size: 8, Positive unconditional cache size: 414, Negative cache size: 47, Negative conditional cache size: 23, Negative unconditional cache size: 24, Eliminated conditions: 2815, SemanticConditionEliminator.Independence Queries: [ total: 2987, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 2961, negative conditional: 146, negative unconditional: 2815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2987, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 2961, negative conditional: 146, negative unconditional: 2815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, positive: 23, positive conditional: 8, positive unconditional: 15, negative: 47, negative conditional: 23, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 180, positive: 44, positive conditional: 10, positive unconditional: 34, negative: 137, negative conditional: 32, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2987, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 2938, negative conditional: 123, negative unconditional: 2815, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 469, Positive cache size: 422, Positive conditional cache size: 8, Positive unconditional cache size: 414, Negative cache size: 47, Negative conditional cache size: 23, Negative unconditional cache size: 24, Eliminated conditions: 2815, SemanticConditionEliminator.Independence Queries: [ total: 2987, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 2961, negative conditional: 146, negative unconditional: 2815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2987, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 2961, negative conditional: 146, negative unconditional: 2815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, positive: 23, positive conditional: 8, positive unconditional: 15, negative: 47, negative conditional: 23, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 180, positive: 44, positive conditional: 10, positive unconditional: 34, negative: 137, negative conditional: 32, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2987, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 2938, negative conditional: 123, negative unconditional: 2815, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 469, Positive cache size: 422, Positive conditional cache size: 8, Positive unconditional cache size: 414, Negative cache size: 47, Negative conditional cache size: 23, Negative unconditional cache size: 24, Eliminated conditions: 2815, SemanticConditionEliminator.Independence Queries: [ total: 2987, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 2961, negative conditional: 146, negative unconditional: 2815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2987, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 2961, negative conditional: 146, negative unconditional: 2815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, positive: 23, positive conditional: 8, positive unconditional: 15, negative: 47, negative conditional: 23, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 180, positive: 44, positive conditional: 10, positive unconditional: 34, negative: 137, negative conditional: 32, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2987, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 2938, negative conditional: 123, negative unconditional: 2815, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 469, Positive cache size: 422, Positive conditional cache size: 8, Positive unconditional cache size: 414, Negative cache size: 47, Negative conditional cache size: 23, Negative unconditional cache size: 24, Eliminated conditions: 2815, SemanticConditionEliminator.Independence Queries: [ total: 2987, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 2961, negative conditional: 146, negative unconditional: 2815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2987, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 2961, negative conditional: 146, negative unconditional: 2815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, positive: 23, positive conditional: 8, positive unconditional: 15, negative: 47, negative conditional: 23, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 180, positive: 44, positive conditional: 10, positive unconditional: 34, negative: 137, negative conditional: 32, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2987, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 2938, negative conditional: 123, negative unconditional: 2815, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 469, Positive cache size: 422, Positive conditional cache size: 8, Positive unconditional cache size: 414, Negative cache size: 47, Negative conditional cache size: 23, Negative unconditional cache size: 24, Eliminated conditions: 2815 ], Maximal queried relation: 8, Independence queries for same thread: 921 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7067, positive: 5834, positive conditional: 5834, positive unconditional: 0, negative: 1233, negative conditional: 1233, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 6141, positive: 5834, positive conditional: 5834, positive unconditional: 0, negative: 307, negative conditional: 307, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 6141, positive: 5834, positive conditional: 0, positive unconditional: 5834, negative: 307, negative conditional: 0, negative unconditional: 307, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 564, positive: 530, positive conditional: 0, positive unconditional: 530, 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: 564, positive: 507, positive conditional: 0, positive unconditional: 507, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, positive: 23, positive conditional: 0, positive unconditional: 23, 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: 57, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 99, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6141, positive: 5304, positive conditional: 0, positive unconditional: 5304, negative: 273, negative conditional: 0, negative unconditional: 273, unknown: 564, unknown conditional: 0, unknown unconditional: 564] , Statistics on independence cache: Total cache size (in pairs): 564, Positive cache size: 530, Positive conditional cache size: 0, Positive unconditional cache size: 530, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 ], Maximal queried relation: 0, Independence queries for same thread: 926 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7067, positive: 5834, positive conditional: 5834, positive unconditional: 0, negative: 1233, negative conditional: 1233, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 6141, positive: 5834, positive conditional: 5834, positive unconditional: 0, negative: 307, negative conditional: 307, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 6141, positive: 5834, positive conditional: 0, positive unconditional: 5834, negative: 307, negative conditional: 0, negative unconditional: 307, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 564, positive: 530, positive conditional: 0, positive unconditional: 530, 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: 564, positive: 507, positive conditional: 0, positive unconditional: 507, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, positive: 23, positive conditional: 0, positive unconditional: 23, 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: 57, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6141, positive: 5304, positive conditional: 0, positive unconditional: 5304, negative: 273, negative conditional: 0, negative unconditional: 273, unknown: 564, unknown conditional: 0, unknown unconditional: 564] , Statistics on independence cache: Total cache size (in pairs): 564, Positive cache size: 530, Positive conditional cache size: 0, Positive unconditional cache size: 530, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 ], Maximal queried relation: 0, Independence queries for same thread: 926 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7067, positive: 5834, positive conditional: 5834, positive unconditional: 0, negative: 1233, negative conditional: 1233, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 6141, positive: 5834, positive conditional: 5834, positive unconditional: 0, negative: 307, negative conditional: 307, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 6141, positive: 5834, positive conditional: 0, positive unconditional: 5834, negative: 307, negative conditional: 0, negative unconditional: 307, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 564, positive: 530, positive conditional: 0, positive unconditional: 530, 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: 564, positive: 507, positive conditional: 0, positive unconditional: 507, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, positive: 23, positive conditional: 0, positive unconditional: 23, 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: 57, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6141, positive: 5304, positive conditional: 0, positive unconditional: 5304, negative: 273, negative conditional: 0, negative unconditional: 273, unknown: 564, unknown conditional: 0, unknown unconditional: 564] , Statistics on independence cache: Total cache size (in pairs): 564, Positive cache size: 530, Positive conditional cache size: 0, Positive unconditional cache size: 530, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 ], Maximal queried relation: 0, Independence queries for same thread: 926 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9038, positive: 7159, positive conditional: 7159, positive unconditional: 0, negative: 1879, negative conditional: 1879, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 7827, positive: 7159, positive conditional: 7159, positive unconditional: 0, negative: 668, negative conditional: 668, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 7827, positive: 7120, positive conditional: 0, positive unconditional: 7120, negative: 707, negative conditional: 0, negative unconditional: 707, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 462, positive: 431, positive conditional: 0, positive unconditional: 431, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 462, positive: 412, positive conditional: 0, positive unconditional: 412, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 85, positive: 29, positive conditional: 10, positive unconditional: 19, negative: 56, negative conditional: 25, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, positive: 18, positive conditional: 7, positive unconditional: 11, negative: 60, negative conditional: 24, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7827, positive: 6689, positive conditional: 0, positive unconditional: 6689, negative: 676, negative conditional: 0, negative unconditional: 676, unknown: 462, unknown conditional: 0, unknown unconditional: 462] , Statistics on independence cache: Total cache size (in pairs): 497, Positive cache size: 441, Positive conditional cache size: 10, Positive unconditional cache size: 431, Negative cache size: 56, Negative conditional cache size: 25, Negative unconditional cache size: 31, SemanticConditionEliminator.Independence Queries: [ total: 3949, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3910, negative conditional: 175, negative unconditional: 3735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3949, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3910, negative conditional: 175, negative unconditional: 3735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 85, positive: 29, positive conditional: 10, positive unconditional: 19, negative: 56, negative conditional: 25, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, positive: 18, positive conditional: 7, positive unconditional: 11, negative: 60, negative conditional: 24, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3949, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 3885, negative conditional: 150, negative unconditional: 3735, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 497, Positive cache size: 441, Positive conditional cache size: 10, Positive unconditional cache size: 431, Negative cache size: 56, Negative conditional cache size: 25, Negative unconditional cache size: 31, Eliminated conditions: 3735, SemanticConditionEliminator.Independence Queries: [ total: 3949, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3910, negative conditional: 175, negative unconditional: 3735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3949, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3910, negative conditional: 175, negative unconditional: 3735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 85, positive: 29, positive conditional: 10, positive unconditional: 19, negative: 56, negative conditional: 25, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, positive: 18, positive conditional: 7, positive unconditional: 11, negative: 60, negative conditional: 24, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3949, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 3885, negative conditional: 150, negative unconditional: 3735, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 497, Positive cache size: 441, Positive conditional cache size: 10, Positive unconditional cache size: 431, Negative cache size: 56, Negative conditional cache size: 25, Negative unconditional cache size: 31, Eliminated conditions: 3735, SemanticConditionEliminator.Independence Queries: [ total: 3949, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3910, negative conditional: 175, negative unconditional: 3735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3949, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3910, negative conditional: 175, negative unconditional: 3735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 85, positive: 29, positive conditional: 10, positive unconditional: 19, negative: 56, negative conditional: 25, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, positive: 18, positive conditional: 7, positive unconditional: 11, negative: 60, negative conditional: 24, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3949, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 3885, negative conditional: 150, negative unconditional: 3735, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 497, Positive cache size: 441, Positive conditional cache size: 10, Positive unconditional cache size: 431, Negative cache size: 56, Negative conditional cache size: 25, Negative unconditional cache size: 31, Eliminated conditions: 3735, SemanticConditionEliminator.Independence Queries: [ total: 3949, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3910, negative conditional: 175, negative unconditional: 3735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3949, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3910, negative conditional: 175, negative unconditional: 3735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 85, positive: 29, positive conditional: 10, positive unconditional: 19, negative: 56, negative conditional: 25, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, positive: 18, positive conditional: 7, positive unconditional: 11, negative: 60, negative conditional: 24, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3949, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 3885, negative conditional: 150, negative unconditional: 3735, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 497, Positive cache size: 441, Positive conditional cache size: 10, Positive unconditional cache size: 431, Negative cache size: 56, Negative conditional cache size: 25, Negative unconditional cache size: 31, Eliminated conditions: 3735, SemanticConditionEliminator.Independence Queries: [ total: 3949, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3910, negative conditional: 175, negative unconditional: 3735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3949, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3910, negative conditional: 175, negative unconditional: 3735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 85, positive: 29, positive conditional: 10, positive unconditional: 19, negative: 56, negative conditional: 25, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, positive: 18, positive conditional: 7, positive unconditional: 11, negative: 60, negative conditional: 24, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3949, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 3885, negative conditional: 150, negative unconditional: 3735, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 497, Positive cache size: 441, Positive conditional cache size: 10, Positive unconditional cache size: 431, Negative cache size: 56, Negative conditional cache size: 25, Negative unconditional cache size: 31, Eliminated conditions: 3735, SemanticConditionEliminator.Independence Queries: [ total: 3949, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3910, negative conditional: 175, negative unconditional: 3735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3949, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3910, negative conditional: 175, negative unconditional: 3735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 85, positive: 29, positive conditional: 10, positive unconditional: 19, negative: 56, negative conditional: 25, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, positive: 18, positive conditional: 7, positive unconditional: 11, negative: 60, negative conditional: 24, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3949, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 3885, negative conditional: 150, negative unconditional: 3735, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 497, Positive cache size: 441, Positive conditional cache size: 10, Positive unconditional cache size: 431, Negative cache size: 56, Negative conditional cache size: 25, Negative unconditional cache size: 31, Eliminated conditions: 3735, SemanticConditionEliminator.Independence Queries: [ total: 3949, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3910, negative conditional: 175, negative unconditional: 3735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3949, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3910, negative conditional: 175, negative unconditional: 3735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 85, positive: 29, positive conditional: 10, positive unconditional: 19, negative: 56, negative conditional: 25, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, positive: 18, positive conditional: 7, positive unconditional: 11, negative: 60, negative conditional: 24, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3949, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 3885, negative conditional: 150, negative unconditional: 3735, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 497, Positive cache size: 441, Positive conditional cache size: 10, Positive unconditional cache size: 431, Negative cache size: 56, Negative conditional cache size: 25, Negative unconditional cache size: 31, Eliminated conditions: 3735, SemanticConditionEliminator.Independence Queries: [ total: 3949, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3910, negative conditional: 175, negative unconditional: 3735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3949, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3910, negative conditional: 175, negative unconditional: 3735, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 85, positive: 29, positive conditional: 10, positive unconditional: 19, negative: 56, negative conditional: 25, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, positive: 18, positive conditional: 7, positive unconditional: 11, negative: 60, negative conditional: 24, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3949, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 3885, negative conditional: 150, negative unconditional: 3735, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 497, Positive cache size: 441, Positive conditional cache size: 10, Positive unconditional cache size: 431, Negative cache size: 56, Negative conditional cache size: 25, Negative unconditional cache size: 31, Eliminated conditions: 3735 ], Maximal queried relation: 8, Independence queries for same thread: 1211 - CounterExampleResult [Line: 87]: assertion can be violated assertion can be violated We found a FailurePath: [L28] 0 critical := 0; VAL [critical=0] [L29] 0 clk := 0; VAL [clk=0, critical=0] [L30] 0 assume wait >= 1; VAL [clk=0, critical=0, wait=1] [L33] 0 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK 0 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK 0 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L36] FORK 0 fork 2 Process2(); 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] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L87] 3 assert critical == 0; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [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] [L88] 3 critical := 2; VAL [clk=2, critical=2, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=2, critical=2, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L89] 3 critical := 0; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=2, critical=1, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=2, critical=1, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=2, critical=1, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=2, critical=1, deadline=2, deadline=3, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=2, critical=1, deadline=2, deadline=3, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=2, critical=1, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=2, critical=1, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=2, critical=1, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=1, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=3, critical=1, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=3, critical=1, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=3, critical=1, deadline=2, deadline=3, delay=1, lock=2, wait=1] - CounterExampleResult [Line: 66]: assertion can be violated assertion can be violated We found a FailurePath: [L28] 0 critical := 0; VAL [critical=0] [L29] 0 clk := 0; VAL [clk=0, critical=0] [L30] 0 assume wait >= 1; VAL [clk=0, critical=0, wait=1] [L33] 0 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK 0 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK 0 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L36] FORK 0 fork 2 Process2(); 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] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L87] 3 assert critical == 0; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [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] [L88] 3 critical := 2; VAL [clk=2, critical=2, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=2, critical=2, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L89] 3 critical := 0; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=3, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=3, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=3, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=3, critical=2, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=3, critical=2, deadline=2, deadline=3, delay=1, lock=2, wait=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process2Thread1of1ForFork2 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1191.6ms, OverallIterations: 9, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 18.7ms, PartialOrderReductionTime: 619.9ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 21.6ms SsaConstructionTime, 98.8ms SatisfiabilityAnalysisTime, 196.2ms InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 98/98 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: 256.0ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.3ms, PartialOrderReductionTime: 244.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: 165.8ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.2ms, PartialOrderReductionTime: 156.6ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 169.6ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.9ms, PartialOrderReductionTime: 155.9ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process1Thread1of1ForFork1 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 525.7ms, OverallIterations: 9, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.8ms, PartialOrderReductionTime: 335.4ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 5.3ms SsaConstructionTime, 21.2ms SatisfiabilityAnalysisTime, 77.9ms InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 309 ConstructedInterpolants, 0 QuantifiedInterpolants, 449 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 94/94 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...