/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleep-NoLbe-Symm.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-98196c323137eee61a7c1131837b356358d783d4-98196c3 [2021-06-16 20:13:16,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-16 20:13:16,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-16 20:13:16,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-16 20:13:16,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-16 20:13:16,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-16 20:13:16,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-16 20:13:16,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-16 20:13:16,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-16 20:13:16,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-16 20:13:16,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-16 20:13:16,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-16 20:13:16,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-16 20:13:16,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-16 20:13:16,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-16 20:13:16,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-16 20:13:16,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-16 20:13:16,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-16 20:13:16,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-16 20:13:16,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-16 20:13:16,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-16 20:13:16,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-16 20:13:16,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-16 20:13:16,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-16 20:13:16,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-16 20:13:16,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-16 20:13:16,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-16 20:13:16,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-16 20:13:16,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-16 20:13:16,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-16 20:13:16,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-16 20:13:16,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-16 20:13:16,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-16 20:13:16,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-16 20:13:16,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-16 20:13:16,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-16 20:13:16,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-16 20:13:16,294 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-16 20:13:16,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-16 20:13:16,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-16 20:13:16,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-16 20:13:16,298 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleep-NoLbe-Symm.epf [2021-06-16 20:13:16,345 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-16 20:13:16,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-16 20:13:16,345 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-16 20:13:16,345 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-16 20:13:16,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-16 20:13:16,348 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-16 20:13:16,348 INFO L138 SettingsManager]: * Use SBE=true [2021-06-16 20:13:16,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-16 20:13:16,348 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-16 20:13:16,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-16 20:13:16,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-16 20:13:16,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-16 20:13:16,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-16 20:13:16,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-16 20:13:16,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-16 20:13:16,349 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-16 20:13:16,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-16 20:13:16,349 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-16 20:13:16,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-16 20:13:16,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-16 20:13:16,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-16 20:13:16,350 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-16 20:13:16,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-16 20:13:16,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-16 20:13:16,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-16 20:13:16,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-16 20:13:16,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-16 20:13:16,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-16 20:13:16,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-16 20:13:16,366 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-16 20:13:16,366 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-06-16 20:13:16,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-16 20:13:16,366 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2021-06-16 20:13:16,366 INFO L138 SettingsManager]: * Limit POR to symmetric independence in concurrent analysis=true [2021-06-16 20:13:16,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-16 20:13:16,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-16 20:13:16,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-16 20:13:16,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-16 20:13:16,836 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-16 20:13:16,855 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-16 20:13:16,856 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-16 20:13:16,856 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2021-06-16 20:13:16,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-16 20:13:16,895 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-16 20:13:16,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-16 20:13:16,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-16 20:13:16,908 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-16 20:13:16,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.06 08:13:16" (1/1) ... [2021-06-16 20:13:16,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.06 08:13:16" (1/1) ... [2021-06-16 20:13:16,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-16 20:13:16,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-16 20:13:16,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-16 20:13:16,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-16 20:13:16,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.06 08:13:16" (1/1) ... [2021-06-16 20:13:16,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.06 08:13:16" (1/1) ... [2021-06-16 20:13:16,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.06 08:13:16" (1/1) ... [2021-06-16 20:13:16,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.06 08:13:16" (1/1) ... [2021-06-16 20:13:16,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.06 08:13:16" (1/1) ... [2021-06-16 20:13:16,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.06 08:13:16" (1/1) ... [2021-06-16 20:13:16,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.06 08:13:16" (1/1) ... [2021-06-16 20:13:16,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-16 20:13:16,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-16 20:13:16,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-16 20:13:16,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-16 20:13:16,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.06 08:13:16" (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-16 20:13:17,056 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2021-06-16 20:13:17,057 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2021-06-16 20:13:17,057 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2021-06-16 20:13:17,057 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2021-06-16 20:13:17,057 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2021-06-16 20:13:17,057 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2021-06-16 20:13:17,058 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-16 20:13:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-16 20:13:17,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-16 20:13:17,058 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2021-06-16 20:13:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2021-06-16 20:13:17,058 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2021-06-16 20:13:17,059 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-16 20:13:17,328 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-16 20:13:17,328 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-06-16 20:13:17,330 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.06 08:13:17 BoogieIcfgContainer [2021-06-16 20:13:17,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-16 20:13:17,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-16 20:13:17,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-16 20:13:17,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-16 20:13:17,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.06 08:13:16" (1/2) ... [2021-06-16 20:13:17,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1368a27b and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.06 08:13:17, skipping insertion in model container [2021-06-16 20:13:17,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.06 08:13:17" (2/2) ... [2021-06-16 20:13:17,350 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2021-06-16 20:13:17,354 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-16 20:13:17,354 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-16 20:13:17,355 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-16 20:13:17,355 INFO L470 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-16 20:13:17,387 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,387 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,392 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,392 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,393 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,393 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,393 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,393 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,394 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,394 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,395 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,395 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,395 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,395 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,396 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,396 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,408 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,410 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 20:13:17,418 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-16 20:13:17,465 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-16 20:13:17,587 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 20:13:17,588 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 20:13:17,588 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 20:13:17,588 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 20:13:17,588 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 20:13:17,588 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 20:13:17,588 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 20:13:17,588 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2Thread1of1ForFork2======== [2021-06-16 20:13:17,639 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:17,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:17,646 INFO L82 PathProgramCache]: Analyzing trace with hash 326055189, now seen corresponding path program 1 times [2021-06-16 20:13:17,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:17,664 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184506119] [2021-06-16 20:13:17,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:17,840 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-16 20:13:17,841 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:17,841 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184506119] [2021-06-16 20:13:17,842 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184506119] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 20:13:17,842 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 20:13:17,842 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-16 20:13:17,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652255299] [2021-06-16 20:13:17,846 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-16 20:13:17,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:17,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-16 20:13:17,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-16 20:13:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:17,875 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:17,880 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-16 20:13:17,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:17,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:17,983 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-16 20:13:17,983 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:17,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:17,983 INFO L82 PathProgramCache]: Analyzing trace with hash 550866052, now seen corresponding path program 1 times [2021-06-16 20:13:17,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:17,984 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380093268] [2021-06-16 20:13:17,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:18,040 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-16 20:13:18,041 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:18,041 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380093268] [2021-06-16 20:13:18,041 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380093268] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 20:13:18,041 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 20:13:18,041 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-16 20:13:18,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476113533] [2021-06-16 20:13:18,042 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 20:13:18,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:18,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 20:13:18,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 20:13:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:18,044 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:18,044 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 20:13:18,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:18,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:18,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:18,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:18,324 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-16 20:13:18,325 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:18,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:18,326 INFO L82 PathProgramCache]: Analyzing trace with hash 555398808, now seen corresponding path program 1 times [2021-06-16 20:13:18,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:18,326 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397519966] [2021-06-16 20:13:18,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2021-06-16 20:13:18,477 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:18,477 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397519966] [2021-06-16 20:13:18,477 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397519966] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 20:13:18,478 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 20:13:18,478 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-16 20:13:18,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340259691] [2021-06-16 20:13:18,478 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 20:13:18,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:18,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 20:13:18,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 20:13:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:18,479 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:18,480 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-16 20:13:18,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:18,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:18,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:18,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:18,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:18,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:18,579 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-16 20:13:18,579 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:18,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:18,579 INFO L82 PathProgramCache]: Analyzing trace with hash 2097693488, now seen corresponding path program 1 times [2021-06-16 20:13:18,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:18,580 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321719753] [2021-06-16 20:13:18,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2021-06-16 20:13:18,738 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:18,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321719753] [2021-06-16 20:13:18,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321719753] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 20:13:18,741 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 20:13:18,741 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-16 20:13:18,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505944964] [2021-06-16 20:13:18,742 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 20:13:18,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:18,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 20:13:18,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 20:13:18,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:18,743 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:18,743 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-16 20:13:18,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:18,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:18,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:18,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:18,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:18,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:18,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:18,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:18,905 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-16 20:13:18,905 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:18,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:18,906 INFO L82 PathProgramCache]: Analyzing trace with hash 823772018, now seen corresponding path program 2 times [2021-06-16 20:13:18,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:18,906 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027946766] [2021-06-16 20:13:18,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 493 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2021-06-16 20:13:19,017 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:19,017 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027946766] [2021-06-16 20:13:19,017 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027946766] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 20:13:19,017 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 20:13:19,017 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-16 20:13:19,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663038292] [2021-06-16 20:13:19,018 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 20:13:19,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:19,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 20:13:19,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 20:13:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,019 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:19,019 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 20:13:19,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,120 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-16 20:13:19,120 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:19,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:19,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1907663592, now seen corresponding path program 3 times [2021-06-16 20:13:19,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:19,122 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471680469] [2021-06-16 20:13:19,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 542 proven. 0 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2021-06-16 20:13:19,234 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:19,235 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471680469] [2021-06-16 20:13:19,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471680469] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 20:13:19,235 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 20:13:19,236 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-16 20:13:19,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185721390] [2021-06-16 20:13:19,236 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 20:13:19,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:19,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 20:13:19,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 20:13:19,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,240 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:19,240 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-16 20:13:19,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,342 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-16 20:13:19,342 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:19,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:19,343 INFO L82 PathProgramCache]: Analyzing trace with hash 678423390, now seen corresponding path program 4 times [2021-06-16 20:13:19,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:19,344 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889777877] [2021-06-16 20:13:19,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:19,382 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2021-06-16 20:13:19,382 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:19,382 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889777877] [2021-06-16 20:13:19,382 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889777877] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 20:13:19,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 20:13:19,383 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-16 20:13:19,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934116538] [2021-06-16 20:13:19,383 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 20:13:19,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:19,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 20:13:19,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 20:13:19,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,391 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:19,392 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 20:13:19,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,446 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-16 20:13:19,446 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:19,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:19,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1455138962, now seen corresponding path program 5 times [2021-06-16 20:13:19,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:19,450 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109471399] [2021-06-16 20:13:19,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:19,474 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2021-06-16 20:13:19,475 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:19,475 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109471399] [2021-06-16 20:13:19,475 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109471399] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 20:13:19,475 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 20:13:19,478 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-16 20:13:19,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33743483] [2021-06-16 20:13:19,479 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-16 20:13:19,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:19,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-16 20:13:19,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-16 20:13:19,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,479 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:19,480 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-16 20:13:19,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:19,545 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-16 20:13:19,545 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:19,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:19,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1143725701, now seen corresponding path program 6 times [2021-06-16 20:13:19,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:19,546 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056318745] [2021-06-16 20:13:19,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-06-16 20:13:19,571 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:19,571 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056318745] [2021-06-16 20:13:19,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056318745] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 20:13:19,571 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 20:13:19,571 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-16 20:13:19,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988141630] [2021-06-16 20:13:19,573 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-16 20:13:19,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:19,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-16 20:13:19,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-16 20:13:19,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,574 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:19,574 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 20:13:19,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:19,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:19,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:19,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:19,777 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-16 20:13:19,777 INFO L430 AbstractCegarLoop]: === Iteration 10 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:19,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:19,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1134509750, now seen corresponding path program 7 times [2021-06-16 20:13:19,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:19,778 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250995370] [2021-06-16 20:13:19,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 101 proven. 26 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-06-16 20:13:19,872 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:19,872 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250995370] [2021-06-16 20:13:19,872 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250995370] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 20:13:19,873 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333820076] [2021-06-16 20:13:19,873 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-16 20:13:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:20,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-16 20:13:20,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-16 20:13:20,482 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 107 proven. 26 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-06-16 20:13:20,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333820076] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 20:13:20,482 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-16 20:13:20,482 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-16 20:13:20,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079846142] [2021-06-16 20:13:20,484 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-16 20:13:20,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:20,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-16 20:13:20,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-06-16 20:13:20,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:20,487 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:20,487 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 8.466666666666667) internal successors, (127), 15 states have internal predecessors, (127), 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-16 20:13:20,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:20,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:20,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:20,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:20,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:20,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:20,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:20,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:20,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:20,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:21,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-16 20:13:21,765 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-06-16 20:13:21,765 INFO L430 AbstractCegarLoop]: === Iteration 11 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:21,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:21,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2049669343, now seen corresponding path program 8 times [2021-06-16 20:13:21,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:21,769 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926177466] [2021-06-16 20:13:21,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-16 20:13:21,804 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-16 20:13:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-16 20:13:21,825 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-16 20:13:21,841 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-16 20:13:21,841 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-16 20:13:21,842 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-16 20:13:21,850 INFO L301 ceAbstractionStarter]: Result for error location Process2Thread1of1ForFork2 was UNSAFE (1/5) [2021-06-16 20:13:21,853 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-16 20:13:21,879 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 20:13:21,879 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 20:13:21,879 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 20:13:21,879 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 20:13:21,879 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 20:13:21,879 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 20:13:21,880 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 20:13:21,880 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2======== [2021-06-16 20:13:22,193 INFO L301 ceAbstractionStarter]: Result for error location Process2 was SAFE (2/5) [2021-06-16 20:13:22,194 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-16 20:13:22,211 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 20:13:22,212 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 20:13:22,212 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 20:13:22,212 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 20:13:22,212 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 20:13:22,212 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 20:13:22,212 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 20:13:22,212 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1======== [2021-06-16 20:13:22,398 INFO L301 ceAbstractionStarter]: Result for error location Process1 was SAFE (3/5) [2021-06-16 20:13:22,399 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-16 20:13:22,424 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 20:13:22,424 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 20:13:22,424 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 20:13:22,424 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 20:13:22,424 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 20:13:22,424 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 20:13:22,424 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 20:13:22,424 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-16 20:13:22,600 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (4/5) [2021-06-16 20:13:22,601 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-16 20:13:22,624 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 20:13:22,624 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 20:13:22,624 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 20:13:22,624 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 20:13:22,624 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 20:13:22,625 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 20:13:22,625 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 20:13:22,625 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1Thread1of1ForFork1======== [2021-06-16 20:13:22,627 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:22,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:22,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1986709147, now seen corresponding path program 1 times [2021-06-16 20:13:22,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:22,627 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707289928] [2021-06-16 20:13:22,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:22,633 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-16 20:13:22,633 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:22,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707289928] [2021-06-16 20:13:22,634 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707289928] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 20:13:22,634 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 20:13:22,634 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-16 20:13:22,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652343077] [2021-06-16 20:13:22,634 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-16 20:13:22,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:22,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-16 20:13:22,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-16 20:13:22,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,634 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:22,635 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 20:13:22,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,668 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-16 20:13:22,668 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:22,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:22,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1309413604, now seen corresponding path program 1 times [2021-06-16 20:13:22,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:22,669 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654804948] [2021-06-16 20:13:22,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:22,677 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-16 20:13:22,678 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:22,678 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654804948] [2021-06-16 20:13:22,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654804948] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 20:13:22,678 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 20:13:22,678 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-16 20:13:22,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140445886] [2021-06-16 20:13:22,678 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 20:13:22,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:22,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 20:13:22,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 20:13:22,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,679 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:22,679 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 20:13:22,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,710 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-16 20:13:22,710 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:22,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:22,711 INFO L82 PathProgramCache]: Analyzing trace with hash 726949200, now seen corresponding path program 1 times [2021-06-16 20:13:22,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:22,711 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109418767] [2021-06-16 20:13:22,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:22,726 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2021-06-16 20:13:22,726 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:22,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109418767] [2021-06-16 20:13:22,726 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109418767] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 20:13:22,726 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 20:13:22,726 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-16 20:13:22,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853347836] [2021-06-16 20:13:22,727 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 20:13:22,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:22,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 20:13:22,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 20:13:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,727 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:22,727 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-16 20:13:22,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,801 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-16 20:13:22,801 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:22,801 INFO L82 PathProgramCache]: Analyzing trace with hash 995883914, now seen corresponding path program 1 times [2021-06-16 20:13:22,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:22,801 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645882323] [2021-06-16 20:13:22,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2021-06-16 20:13:22,833 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:22,833 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645882323] [2021-06-16 20:13:22,833 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645882323] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 20:13:22,833 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 20:13:22,833 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-16 20:13:22,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044466928] [2021-06-16 20:13:22,834 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 20:13:22,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:22,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 20:13:22,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 20:13:22,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,835 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:22,835 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 20:13:22,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,867 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-16 20:13:22,867 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:22,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:22,867 INFO L82 PathProgramCache]: Analyzing trace with hash -761903574, now seen corresponding path program 2 times [2021-06-16 20:13:22,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:22,867 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510133343] [2021-06-16 20:13:22,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2021-06-16 20:13:22,887 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:22,887 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510133343] [2021-06-16 20:13:22,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510133343] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 20:13:22,888 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 20:13:22,888 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-16 20:13:22,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368989177] [2021-06-16 20:13:22,888 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 20:13:22,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:22,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 20:13:22,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 20:13:22,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,888 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:22,889 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-16 20:13:22,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,922 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-16 20:13:22,922 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:22,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:22,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2064863715, now seen corresponding path program 3 times [2021-06-16 20:13:22,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:22,923 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896485384] [2021-06-16 20:13:22,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2021-06-16 20:13:22,948 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:22,948 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896485384] [2021-06-16 20:13:22,948 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896485384] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 20:13:22,949 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 20:13:22,949 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-16 20:13:22,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079063919] [2021-06-16 20:13:22,949 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 20:13:22,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:22,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 20:13:22,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 20:13:22,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,949 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:22,949 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 20:13:22,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:22,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:22,986 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-16 20:13:22,986 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:22,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:22,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2009888278, now seen corresponding path program 4 times [2021-06-16 20:13:22,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:22,987 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608485892] [2021-06-16 20:13:22,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2021-06-16 20:13:23,049 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:23,049 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608485892] [2021-06-16 20:13:23,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608485892] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 20:13:23,050 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 20:13:23,050 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-16 20:13:23,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295597542] [2021-06-16 20:13:23,050 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-16 20:13:23,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:23,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-16 20:13:23,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-16 20:13:23,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:23,051 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:23,051 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-16 20:13:23,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:23,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:23,133 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-16 20:13:23,133 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:23,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:23,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1871952769, now seen corresponding path program 5 times [2021-06-16 20:13:23,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:23,133 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003434874] [2021-06-16 20:13:23,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-06-16 20:13:23,160 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:23,160 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003434874] [2021-06-16 20:13:23,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003434874] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 20:13:23,160 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 20:13:23,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-16 20:13:23,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81494795] [2021-06-16 20:13:23,162 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-16 20:13:23,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:23,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-16 20:13:23,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-16 20:13:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:23,162 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:23,163 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 20:13:23,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:23,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:23,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:23,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:23,234 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-16 20:13:23,234 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:23,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:23,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1425213936, now seen corresponding path program 6 times [2021-06-16 20:13:23,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:23,234 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029389390] [2021-06-16 20:13:23,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 70 proven. 26 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-16 20:13:23,295 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:23,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029389390] [2021-06-16 20:13:23,295 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029389390] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 20:13:23,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773642793] [2021-06-16 20:13:23,296 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-16 20:13:23,346 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-16 20:13:23,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-16 20:13:23,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-16 20:13:23,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-16 20:13:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 74 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-16 20:13:23,499 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773642793] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 20:13:23,499 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-16 20:13:23,499 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2021-06-16 20:13:23,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643172542] [2021-06-16 20:13:23,500 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-16 20:13:23,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:23,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-16 20:13:23,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-06-16 20:13:23,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:23,500 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:23,501 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 13 states have internal predecessors, (119), 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-16 20:13:23,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:23,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:23,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:23,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:23,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:23,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-16 20:13:24,217 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-16 20:13:24,217 INFO L430 AbstractCegarLoop]: === Iteration 10 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:24,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:24,218 INFO L82 PathProgramCache]: Analyzing trace with hash -556939951, now seen corresponding path program 7 times [2021-06-16 20:13:24,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:24,218 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500535353] [2021-06-16 20:13:24,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 102 proven. 107 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-06-16 20:13:24,378 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 20:13:24,379 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500535353] [2021-06-16 20:13:24,379 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500535353] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 20:13:24,379 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69786687] [2021-06-16 20:13:24,379 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-16 20:13:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 20:13:24,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-16 20:13:24,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-16 20:13:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 102 proven. 107 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-06-16 20:13:24,640 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69786687] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 20:13:24,640 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-16 20:13:24,640 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2021-06-16 20:13:24,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818754035] [2021-06-16 20:13:24,641 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-16 20:13:24,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 20:13:24,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-16 20:13:24,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-16 20:13:24,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:24,642 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 20:13:24,642 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 20:13:24,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:24,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:24,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:24,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:24,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:24,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:24,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:24,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:24,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-06-16 20:13:24,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 20:13:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 20:13:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:25,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-16 20:13:25,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-16 20:13:25,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-16 20:13:25,236 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-06-16 20:13:25,237 INFO L430 AbstractCegarLoop]: === Iteration 11 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-16 20:13:25,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 20:13:25,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1011919171, now seen corresponding path program 8 times [2021-06-16 20:13:25,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 20:13:25,237 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325824102] [2021-06-16 20:13:25,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 20:13:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-16 20:13:25,247 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-16 20:13:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-16 20:13:25,256 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-16 20:13:25,267 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-16 20:13:25,267 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-16 20:13:25,267 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-16 20:13:25,269 INFO L301 ceAbstractionStarter]: Result for error location Process1Thread1of1ForFork1 was UNSAFE (5/5) [2021-06-16 20:13:25,270 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-16 20:13:25,329 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.06 08:13:25 BasicIcfg [2021-06-16 20:13:25,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-16 20:13:25,330 INFO L168 Benchmark]: Toolchain (without parser) took 8434.61 ms. Allocated memory was 176.2 MB in the beginning and 345.0 MB in the end (delta: 168.8 MB). Free memory was 155.3 MB in the beginning and 215.1 MB in the end (delta: -59.7 MB). Peak memory consumption was 110.6 MB. Max. memory is 8.0 GB. [2021-06-16 20:13:25,330 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 ms. Allocated memory is still 176.2 MB. Free memory is still 156.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-16 20:13:25,330 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.32 ms. Allocated memory is still 176.2 MB. Free memory was 155.3 MB in the beginning and 153.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-06-16 20:13:25,330 INFO L168 Benchmark]: Boogie Preprocessor took 24.50 ms. Allocated memory is still 176.2 MB. Free memory was 153.8 MB in the beginning and 152.8 MB in the end (delta: 990.9 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-06-16 20:13:25,330 INFO L168 Benchmark]: RCFGBuilder took 358.26 ms. Allocated memory is still 176.2 MB. Free memory was 152.8 MB in the beginning and 140.3 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-06-16 20:13:25,330 INFO L168 Benchmark]: TraceAbstraction took 7998.41 ms. Allocated memory was 176.2 MB in the beginning and 345.0 MB in the end (delta: 168.8 MB). Free memory was 139.8 MB in the beginning and 215.1 MB in the end (delta: -75.3 MB). Peak memory consumption was 94.9 MB. Max. memory is 8.0 GB. [2021-06-16 20:13:25,331 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.14 ms. Allocated memory is still 176.2 MB. Free memory is still 156.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 37.32 ms. Allocated memory is still 176.2 MB. Free memory was 155.3 MB in the beginning and 153.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 24.50 ms. Allocated memory is still 176.2 MB. Free memory was 153.8 MB in the beginning and 152.8 MB in the end (delta: 990.9 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 358.26 ms. Allocated memory is still 176.2 MB. Free memory was 152.8 MB in the beginning and 140.3 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7998.41 ms. Allocated memory was 176.2 MB in the beginning and 345.0 MB in the end (delta: 168.8 MB). Free memory was 139.8 MB in the beginning and 215.1 MB in the end (delta: -75.3 MB). Peak memory consumption was 94.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 30830, positive: 22338, positive conditional: 22338, positive unconditional: 0, negative: 8492, negative conditional: 8492, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 25227, positive: 22338, positive conditional: 22338, positive unconditional: 0, negative: 2889, negative conditional: 2889, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 25227, positive: 22017, positive conditional: 0, positive unconditional: 22017, negative: 3210, negative conditional: 0, negative unconditional: 3210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 317, positive: 279, positive conditional: 0, positive unconditional: 279, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 317, positive: 277, positive conditional: 0, positive unconditional: 277, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 217, positive: 25, positive conditional: 23, positive unconditional: 2, negative: 192, negative conditional: 154, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 534, positive: 78, positive conditional: 73, positive unconditional: 5, negative: 457, negative conditional: 269, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25227, positive: 21738, positive conditional: 0, positive unconditional: 21738, negative: 3172, negative conditional: 0, negative unconditional: 3172, unknown: 317, unknown conditional: 0, unknown unconditional: 317] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 302, Positive conditional cache size: 23, Positive unconditional cache size: 279, Negative cache size: 192, Negative conditional cache size: 154, Negative unconditional cache size: 38, SemanticConditionEliminator.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 217, positive: 25, positive conditional: 23, positive unconditional: 2, negative: 192, negative conditional: 154, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 534, positive: 78, positive conditional: 73, positive unconditional: 5, negative: 457, negative conditional: 269, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 23247, positive: 298, positive conditional: 298, positive unconditional: 0, negative: 22772, negative conditional: 2218, negative unconditional: 20554, unknown: 177, unknown conditional: 177, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 302, Positive conditional cache size: 23, Positive unconditional cache size: 279, Negative cache size: 192, Negative conditional cache size: 154, Negative unconditional cache size: 38, Eliminated conditions: 20554, SemanticConditionEliminator.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 217, positive: 25, positive conditional: 23, positive unconditional: 2, negative: 192, negative conditional: 154, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 534, positive: 78, positive conditional: 73, positive unconditional: 5, negative: 457, negative conditional: 269, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 23247, positive: 298, positive conditional: 298, positive unconditional: 0, negative: 22772, negative conditional: 2218, negative unconditional: 20554, unknown: 177, unknown conditional: 177, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 302, Positive conditional cache size: 23, Positive unconditional cache size: 279, Negative cache size: 192, Negative conditional cache size: 154, Negative unconditional cache size: 38, Eliminated conditions: 20554, SemanticConditionEliminator.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 217, positive: 25, positive conditional: 23, positive unconditional: 2, negative: 192, negative conditional: 154, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 534, positive: 78, positive conditional: 73, positive unconditional: 5, negative: 457, negative conditional: 269, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 23247, positive: 298, positive conditional: 298, positive unconditional: 0, negative: 22772, negative conditional: 2218, negative unconditional: 20554, unknown: 177, unknown conditional: 177, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 302, Positive conditional cache size: 23, Positive unconditional cache size: 279, Negative cache size: 192, Negative conditional cache size: 154, Negative unconditional cache size: 38, Eliminated conditions: 20554, SemanticConditionEliminator.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 217, positive: 25, positive conditional: 23, positive unconditional: 2, negative: 192, negative conditional: 154, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 534, positive: 78, positive conditional: 73, positive unconditional: 5, negative: 457, negative conditional: 269, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 23247, positive: 298, positive conditional: 298, positive unconditional: 0, negative: 22772, negative conditional: 2218, negative unconditional: 20554, unknown: 177, unknown conditional: 177, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 302, Positive conditional cache size: 23, Positive unconditional cache size: 279, Negative cache size: 192, Negative conditional cache size: 154, Negative unconditional cache size: 38, Eliminated conditions: 20554, SemanticConditionEliminator.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 217, positive: 25, positive conditional: 23, positive unconditional: 2, negative: 192, negative conditional: 154, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 534, positive: 78, positive conditional: 73, positive unconditional: 5, negative: 457, negative conditional: 269, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 23247, positive: 298, positive conditional: 298, positive unconditional: 0, negative: 22772, negative conditional: 2218, negative unconditional: 20554, unknown: 177, unknown conditional: 177, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 302, Positive conditional cache size: 23, Positive unconditional cache size: 279, Negative cache size: 192, Negative conditional cache size: 154, Negative unconditional cache size: 38, Eliminated conditions: 20554, SemanticConditionEliminator.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 217, positive: 25, positive conditional: 23, positive unconditional: 2, negative: 192, negative conditional: 154, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 534, positive: 78, positive conditional: 73, positive unconditional: 5, negative: 457, negative conditional: 269, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 23247, positive: 298, positive conditional: 298, positive unconditional: 0, negative: 22772, negative conditional: 2218, negative unconditional: 20554, unknown: 177, unknown conditional: 177, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 302, Positive conditional cache size: 23, Positive unconditional cache size: 279, Negative cache size: 192, Negative conditional cache size: 154, Negative unconditional cache size: 38, Eliminated conditions: 20554, SemanticConditionEliminator.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 217, positive: 25, positive conditional: 23, positive unconditional: 2, negative: 192, negative conditional: 154, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 534, positive: 78, positive conditional: 73, positive unconditional: 5, negative: 457, negative conditional: 269, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 23247, positive: 298, positive conditional: 298, positive unconditional: 0, negative: 22772, negative conditional: 2218, negative unconditional: 20554, unknown: 177, unknown conditional: 177, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 302, Positive conditional cache size: 23, Positive unconditional cache size: 279, Negative cache size: 192, Negative conditional cache size: 154, Negative unconditional cache size: 38, Eliminated conditions: 20554, SemanticConditionEliminator.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 217, positive: 25, positive conditional: 23, positive unconditional: 2, negative: 192, negative conditional: 154, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 534, positive: 78, positive conditional: 73, positive unconditional: 5, negative: 457, negative conditional: 269, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 23247, positive: 298, positive conditional: 298, positive unconditional: 0, negative: 22772, negative conditional: 2218, negative unconditional: 20554, unknown: 177, unknown conditional: 177, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 302, Positive conditional cache size: 23, Positive unconditional cache size: 279, Negative cache size: 192, Negative conditional cache size: 154, Negative unconditional cache size: 38, Eliminated conditions: 20554, SemanticConditionEliminator.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 217, positive: 25, positive conditional: 23, positive unconditional: 2, negative: 192, negative conditional: 154, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 534, positive: 78, positive conditional: 73, positive unconditional: 5, negative: 457, negative conditional: 269, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 23247, positive: 298, positive conditional: 298, positive unconditional: 0, negative: 22772, negative conditional: 2218, negative unconditional: 20554, unknown: 177, unknown conditional: 177, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 302, Positive conditional cache size: 23, Positive unconditional cache size: 279, Negative cache size: 192, Negative conditional cache size: 154, Negative unconditional cache size: 38, Eliminated conditions: 20554, SemanticConditionEliminator.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23247, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 22926, negative conditional: 2372, negative unconditional: 20554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 217, positive: 25, positive conditional: 23, positive unconditional: 2, negative: 192, negative conditional: 154, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 534, positive: 78, positive conditional: 73, positive unconditional: 5, negative: 457, negative conditional: 269, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 23247, positive: 298, positive conditional: 298, positive unconditional: 0, negative: 22772, negative conditional: 2218, negative unconditional: 20554, unknown: 177, unknown conditional: 177, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 302, Positive conditional cache size: 23, Positive unconditional cache size: 279, Negative cache size: 192, Negative conditional cache size: 154, Negative unconditional cache size: 38, Eliminated conditions: 20554 ], Maximal queried relation: 10, Independence queries for same thread: 5603 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 30160, positive: 23708, positive conditional: 23708, positive unconditional: 0, negative: 6452, negative conditional: 6452, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 25589, positive: 23708, positive conditional: 23708, positive unconditional: 0, negative: 1881, negative conditional: 1881, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 25589, positive: 23708, positive conditional: 0, positive unconditional: 23708, negative: 1881, negative conditional: 0, negative unconditional: 1881, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 409, positive: 371, positive conditional: 0, positive unconditional: 371, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 409, positive: 369, positive conditional: 0, positive unconditional: 369, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 40, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25589, positive: 23337, positive conditional: 0, positive unconditional: 23337, negative: 1843, negative conditional: 0, negative unconditional: 1843, unknown: 409, unknown conditional: 0, unknown unconditional: 409] , Statistics on independence cache: Total cache size (in pairs): 409, Positive cache size: 371, Positive conditional cache size: 0, Positive unconditional cache size: 371, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38 ], Maximal queried relation: 0, Independence queries for same thread: 4571 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 30160, positive: 23708, positive conditional: 23708, positive unconditional: 0, negative: 6452, negative conditional: 6452, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 25589, positive: 23708, positive conditional: 23708, positive unconditional: 0, negative: 1881, negative conditional: 1881, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 25589, positive: 23708, positive conditional: 0, positive unconditional: 23708, negative: 1881, negative conditional: 0, negative unconditional: 1881, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 409, positive: 371, positive conditional: 0, positive unconditional: 371, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 409, positive: 369, positive conditional: 0, positive unconditional: 369, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 40, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25589, positive: 23337, positive conditional: 0, positive unconditional: 23337, negative: 1843, negative conditional: 0, negative unconditional: 1843, unknown: 409, unknown conditional: 0, unknown unconditional: 409] , Statistics on independence cache: Total cache size (in pairs): 409, Positive cache size: 371, Positive conditional cache size: 0, Positive unconditional cache size: 371, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38 ], Maximal queried relation: 0, Independence queries for same thread: 4571 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 30160, positive: 23708, positive conditional: 23708, positive unconditional: 0, negative: 6452, negative conditional: 6452, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 25589, positive: 23708, positive conditional: 23708, positive unconditional: 0, negative: 1881, negative conditional: 1881, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 25589, positive: 23708, positive conditional: 0, positive unconditional: 23708, negative: 1881, negative conditional: 0, negative unconditional: 1881, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 409, positive: 371, positive conditional: 0, positive unconditional: 371, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 409, positive: 369, positive conditional: 0, positive unconditional: 369, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 40, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25589, positive: 23337, positive conditional: 0, positive unconditional: 23337, negative: 1843, negative conditional: 0, negative unconditional: 1843, unknown: 409, unknown conditional: 0, unknown unconditional: 409] , Statistics on independence cache: Total cache size (in pairs): 409, Positive cache size: 371, Positive conditional cache size: 0, Positive unconditional cache size: 371, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38 ], Maximal queried relation: 0, Independence queries for same thread: 4571 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 38990, positive: 28137, positive conditional: 28137, positive unconditional: 0, negative: 10853, negative conditional: 10853, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 32080, positive: 28137, positive conditional: 28137, positive unconditional: 0, negative: 3943, negative conditional: 3943, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 32080, positive: 27615, positive conditional: 0, positive unconditional: 27615, negative: 4465, negative conditional: 0, negative unconditional: 4465, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 347, positive: 309, positive conditional: 0, positive unconditional: 309, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 347, positive: 307, positive conditional: 0, positive unconditional: 307, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 222, positive: 27, positive conditional: 25, positive unconditional: 2, negative: 195, negative conditional: 157, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 270, positive: 32, positive conditional: 31, positive unconditional: 2, negative: 237, negative conditional: 179, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32080, positive: 27306, positive conditional: 0, positive unconditional: 27306, negative: 4427, negative conditional: 0, negative unconditional: 4427, unknown: 347, unknown conditional: 0, unknown unconditional: 347] , Statistics on independence cache: Total cache size (in pairs): 529, Positive cache size: 334, Positive conditional cache size: 25, Positive unconditional cache size: 309, Negative cache size: 195, Negative conditional cache size: 157, Negative unconditional cache size: 38, SemanticConditionEliminator.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 222, positive: 27, positive conditional: 25, positive unconditional: 2, negative: 195, negative conditional: 157, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 270, positive: 32, positive conditional: 31, positive unconditional: 2, negative: 237, negative conditional: 179, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 35073, positive: 497, positive conditional: 497, positive unconditional: 0, negative: 34394, negative conditional: 5848, negative unconditional: 28546, unknown: 182, unknown conditional: 182, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 529, Positive cache size: 334, Positive conditional cache size: 25, Positive unconditional cache size: 309, Negative cache size: 195, Negative conditional cache size: 157, Negative unconditional cache size: 38, Eliminated conditions: 28546, SemanticConditionEliminator.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 222, positive: 27, positive conditional: 25, positive unconditional: 2, negative: 195, negative conditional: 157, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 270, positive: 32, positive conditional: 31, positive unconditional: 2, negative: 237, negative conditional: 179, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 35073, positive: 497, positive conditional: 497, positive unconditional: 0, negative: 34394, negative conditional: 5848, negative unconditional: 28546, unknown: 182, unknown conditional: 182, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 529, Positive cache size: 334, Positive conditional cache size: 25, Positive unconditional cache size: 309, Negative cache size: 195, Negative conditional cache size: 157, Negative unconditional cache size: 38, Eliminated conditions: 28546, SemanticConditionEliminator.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 222, positive: 27, positive conditional: 25, positive unconditional: 2, negative: 195, negative conditional: 157, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 270, positive: 32, positive conditional: 31, positive unconditional: 2, negative: 237, negative conditional: 179, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 35073, positive: 497, positive conditional: 497, positive unconditional: 0, negative: 34394, negative conditional: 5848, negative unconditional: 28546, unknown: 182, unknown conditional: 182, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 529, Positive cache size: 334, Positive conditional cache size: 25, Positive unconditional cache size: 309, Negative cache size: 195, Negative conditional cache size: 157, Negative unconditional cache size: 38, Eliminated conditions: 28546, SemanticConditionEliminator.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 222, positive: 27, positive conditional: 25, positive unconditional: 2, negative: 195, negative conditional: 157, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 270, positive: 32, positive conditional: 31, positive unconditional: 2, negative: 237, negative conditional: 179, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 35073, positive: 497, positive conditional: 497, positive unconditional: 0, negative: 34394, negative conditional: 5848, negative unconditional: 28546, unknown: 182, unknown conditional: 182, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 529, Positive cache size: 334, Positive conditional cache size: 25, Positive unconditional cache size: 309, Negative cache size: 195, Negative conditional cache size: 157, Negative unconditional cache size: 38, Eliminated conditions: 28546, SemanticConditionEliminator.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 222, positive: 27, positive conditional: 25, positive unconditional: 2, negative: 195, negative conditional: 157, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 270, positive: 32, positive conditional: 31, positive unconditional: 2, negative: 237, negative conditional: 179, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 35073, positive: 497, positive conditional: 497, positive unconditional: 0, negative: 34394, negative conditional: 5848, negative unconditional: 28546, unknown: 182, unknown conditional: 182, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 529, Positive cache size: 334, Positive conditional cache size: 25, Positive unconditional cache size: 309, Negative cache size: 195, Negative conditional cache size: 157, Negative unconditional cache size: 38, Eliminated conditions: 28546, SemanticConditionEliminator.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 222, positive: 27, positive conditional: 25, positive unconditional: 2, negative: 195, negative conditional: 157, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 270, positive: 32, positive conditional: 31, positive unconditional: 2, negative: 237, negative conditional: 179, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 35073, positive: 497, positive conditional: 497, positive unconditional: 0, negative: 34394, negative conditional: 5848, negative unconditional: 28546, unknown: 182, unknown conditional: 182, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 529, Positive cache size: 334, Positive conditional cache size: 25, Positive unconditional cache size: 309, Negative cache size: 195, Negative conditional cache size: 157, Negative unconditional cache size: 38, Eliminated conditions: 28546, SemanticConditionEliminator.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 222, positive: 27, positive conditional: 25, positive unconditional: 2, negative: 195, negative conditional: 157, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 270, positive: 32, positive conditional: 31, positive unconditional: 2, negative: 237, negative conditional: 179, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 35073, positive: 497, positive conditional: 497, positive unconditional: 0, negative: 34394, negative conditional: 5848, negative unconditional: 28546, unknown: 182, unknown conditional: 182, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 529, Positive cache size: 334, Positive conditional cache size: 25, Positive unconditional cache size: 309, Negative cache size: 195, Negative conditional cache size: 157, Negative unconditional cache size: 38, Eliminated conditions: 28546, SemanticConditionEliminator.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 222, positive: 27, positive conditional: 25, positive unconditional: 2, negative: 195, negative conditional: 157, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 270, positive: 32, positive conditional: 31, positive unconditional: 2, negative: 237, negative conditional: 179, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 35073, positive: 497, positive conditional: 497, positive unconditional: 0, negative: 34394, negative conditional: 5848, negative unconditional: 28546, unknown: 182, unknown conditional: 182, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 529, Positive cache size: 334, Positive conditional cache size: 25, Positive unconditional cache size: 309, Negative cache size: 195, Negative conditional cache size: 157, Negative unconditional cache size: 38, Eliminated conditions: 28546, SemanticConditionEliminator.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 222, positive: 27, positive conditional: 25, positive unconditional: 2, negative: 195, negative conditional: 157, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 270, positive: 32, positive conditional: 31, positive unconditional: 2, negative: 237, negative conditional: 179, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 35073, positive: 497, positive conditional: 497, positive unconditional: 0, negative: 34394, negative conditional: 5848, negative unconditional: 28546, unknown: 182, unknown conditional: 182, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 529, Positive cache size: 334, Positive conditional cache size: 25, Positive unconditional cache size: 309, Negative cache size: 195, Negative conditional cache size: 157, Negative unconditional cache size: 38, Eliminated conditions: 28546, SemanticConditionEliminator.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35073, positive: 522, positive conditional: 522, positive unconditional: 0, negative: 34551, negative conditional: 6005, negative unconditional: 28546, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 222, positive: 27, positive conditional: 25, positive unconditional: 2, negative: 195, negative conditional: 157, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 270, positive: 32, positive conditional: 31, positive unconditional: 2, negative: 237, negative conditional: 179, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 35073, positive: 497, positive conditional: 497, positive unconditional: 0, negative: 34394, negative conditional: 5848, negative unconditional: 28546, unknown: 182, unknown conditional: 182, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 529, Positive cache size: 334, Positive conditional cache size: 25, Positive unconditional cache size: 309, Negative cache size: 195, Negative conditional cache size: 157, Negative unconditional cache size: 38, Eliminated conditions: 28546 ], Maximal queried relation: 10, Independence queries for same thread: 6910 - CounterExampleResult [Line: 87]: assertion can be violated assertion can be violated We found a FailurePath: [L28] 0 critical := 0; VAL [critical=0] [L29] 0 clk := 0; VAL [clk=0, critical=0] [L30] 0 assume wait >= 1; VAL [clk=0, critical=0, wait=1] [L33] 0 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK 0 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK 0 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=1, critical=1, deadline=1, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=3, critical=1, deadline=2, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=5, critical=2, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=6, critical=2, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=6, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=7, critical=1, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=8, critical=2, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L69] 2 lock := 0; VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=9, critical=2, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=9, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=10, critical=0, deadline=10, deadline=11, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=10, critical=0, deadline=10, deadline=11, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=10, critical=0, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=10, critical=0, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=10, critical=0, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=10, critical=1, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=11, critical=1, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=11, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=12, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=12, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=12, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=12, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] - CounterExampleResult [Line: 66]: assertion can be violated assertion can be violated We found a FailurePath: [L28] 0 critical := 0; VAL [critical=0] [L29] 0 clk := 0; VAL [clk=0, critical=0] [L30] 0 assume wait >= 1; VAL [clk=0, critical=0, wait=1] [L33] 0 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK 0 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK 0 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=1, critical=1, deadline=1, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=3, critical=1, deadline=2, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=0, deadline=2, delay=1, lock=0, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=5, critical=0, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=5, critical=0, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=6, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=6, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=6, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=6, critical=2, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=6, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=6, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=6, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=6, critical=0, deadline=2, deadline=7, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=6, critical=0, deadline=2, deadline=7, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=6, critical=0, deadline=2, deadline=7, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=6, critical=0, deadline=2, deadline=7, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=6, critical=0, deadline=2, deadline=7, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=6, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=7, critical=2, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=7, critical=0, deadline=8, deadline=8, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=8, critical=0, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=8, critical=0, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=8, critical=1, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=8, critical=0, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=9, critical=0, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=9, critical=0, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=9, critical=0, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=9, critical=0, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=9, critical=2, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=9, critical=0, deadline=8, deadline=9, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=9, critical=0, deadline=8, deadline=9, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=9, critical=0, deadline=8, deadline=9, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=9, critical=0, deadline=8, deadline=10, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=9, critical=0, deadline=8, deadline=10, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=9, critical=0, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=9, critical=0, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=9, critical=0, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=10, critical=0, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=10, critical=0, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=10, critical=0, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=10, critical=0, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=10, critical=2, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=10, critical=0, deadline=8, deadline=10, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=10, critical=0, deadline=8, deadline=10, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=10, critical=0, deadline=8, deadline=10, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=10, critical=0, deadline=8, deadline=11, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=10, critical=0, deadline=8, deadline=11, delay=1, lock=0, wait=1] [L69] 2 lock := 0; VAL [clk=10, critical=0, deadline=8, deadline=11, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=10, critical=0, deadline=8, deadline=11, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=11, critical=2, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=11, critical=0, deadline=12, deadline=11, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=12, critical=0, deadline=12, deadline=11, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=12, critical=0, deadline=12, deadline=11, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=12, critical=0, deadline=12, deadline=11, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=12, critical=0, deadline=12, deadline=11, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=12, critical=0, deadline=12, deadline=11, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=12, critical=0, deadline=12, deadline=13, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=12, critical=0, deadline=12, deadline=13, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=12, critical=0, deadline=12, deadline=13, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=12, critical=0, deadline=12, deadline=13, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=13, critical=0, deadline=12, deadline=13, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=13, critical=0, deadline=12, deadline=14, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=14, critical=0, deadline=12, deadline=14, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=14, critical=0, deadline=12, deadline=14, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=14, critical=0, deadline=12, deadline=14, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=14, critical=0, deadline=12, deadline=14, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=14, critical=2, deadline=12, deadline=14, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=14, critical=2, deadline=12, deadline=14, 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: 4358.7ms, OverallIterations: 11, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.1ms, PartialOrderReductionTime: 2263.7ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 71.4ms SsaConstructionTime, 251.2ms SatisfiabilityAnalysisTime, 1064.5ms InterpolantComputationTime, 1652 NumberOfCodeBlocks, 1652 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1518 ConstructedInterpolants, 0 QuantifiedInterpolants, 2172 SizeOfPredicates, 4 NumberOfNonLiveVariables, 190 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 4573/4625 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: 339.6ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.8ms, PartialOrderReductionTime: 312.1ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process1 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 203.5ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.9ms, PartialOrderReductionTime: 184.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: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 201.1ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.6ms, PartialOrderReductionTime: 173.5ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process1Thread1of1ForFork1 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2667.9ms, OverallIterations: 11, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.6ms, PartialOrderReductionTime: 1270.1ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 56, 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: 34.3ms SsaConstructionTime, 106.1ms SatisfiabilityAnalysisTime, 671.1ms InterpolantComputationTime, 1579 NumberOfCodeBlocks, 1579 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1430 ConstructedInterpolants, 0 QuantifiedInterpolants, 2630 SizeOfPredicates, 8 NumberOfNonLiveVariables, 403 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 3382/3644 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...