/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-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-12 18:54:41,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-12 18:54:41,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-12 18:54:41,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-12 18:54:41,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-12 18:54:41,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-12 18:54:41,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-12 18:54:41,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-12 18:54:41,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-12 18:54:41,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-12 18:54:41,563 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-12 18:54:41,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-12 18:54:41,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-12 18:54:41,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-12 18:54:41,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-12 18:54:41,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-12 18:54:41,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-12 18:54:41,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-12 18:54:41,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-12 18:54:41,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-12 18:54:41,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-12 18:54:41,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-12 18:54:41,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-12 18:54:41,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-12 18:54:41,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-12 18:54:41,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-12 18:54:41,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-12 18:54:41,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-12 18:54:41,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-12 18:54:41,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-12 18:54:41,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-12 18:54:41,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-12 18:54:41,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-12 18:54:41,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-12 18:54:41,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-12 18:54:41,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-12 18:54:41,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-12 18:54:41,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-12 18:54:41,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-12 18:54:41,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-12 18:54:41,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-12 18:54:41,591 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-FA-NoLbe.epf [2021-06-12 18:54:41,615 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-12 18:54:41,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-12 18:54:41,616 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-12 18:54:41,616 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-12 18:54:41,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-12 18:54:41,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-12 18:54:41,618 INFO L138 SettingsManager]: * Use SBE=true [2021-06-12 18:54:41,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-12 18:54:41,618 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-12 18:54:41,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-12 18:54:41,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-12 18:54:41,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-12 18:54:41,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-12 18:54:41,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-12 18:54:41,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-12 18:54:41,619 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-12 18:54:41,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-12 18:54:41,620 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-12 18:54:41,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-12 18:54:41,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-12 18:54:41,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-12 18:54:41,620 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-12 18:54:41,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-12 18:54:41,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 18:54:41,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-12 18:54:41,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-12 18:54:41,621 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-12 18:54:41,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-12 18:54:41,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-12 18:54:41,635 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-12 18:54:41,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-12 18:54:41,635 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-12 18:54:41,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-12 18:54:41,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-12 18:54:41,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-12 18:54:41,892 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-12 18:54:41,893 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-12 18:54:41,894 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-12 18:54:41,894 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2021-06-12 18:54:41,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-12 18:54:41,923 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-12 18:54:41,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-12 18:54:41,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-12 18:54:41,924 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-12 18:54:41,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:54:41" (1/1) ... [2021-06-12 18:54:41,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:54:41" (1/1) ... [2021-06-12 18:54:41,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-12 18:54:41,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-12 18:54:41,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-12 18:54:41,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-12 18:54:41,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:54:41" (1/1) ... [2021-06-12 18:54:41,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:54:41" (1/1) ... [2021-06-12 18:54:41,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:54:41" (1/1) ... [2021-06-12 18:54:41,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:54:41" (1/1) ... [2021-06-12 18:54:41,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:54:41" (1/1) ... [2021-06-12 18:54:41,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:54:41" (1/1) ... [2021-06-12 18:54:41,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:54:41" (1/1) ... [2021-06-12 18:54:41,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-12 18:54:41,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-12 18:54:41,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-12 18:54:41,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-12 18:54:41,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:54:41" (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-12 18:54:42,015 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2021-06-12 18:54:42,015 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2021-06-12 18:54:42,015 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2021-06-12 18:54:42,015 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2021-06-12 18:54:42,015 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2021-06-12 18:54:42,015 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2021-06-12 18:54:42,015 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-12 18:54:42,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-12 18:54:42,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-12 18:54:42,016 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2021-06-12 18:54:42,016 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2021-06-12 18:54:42,016 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2021-06-12 18:54:42,016 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-12 18:54:42,134 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-12 18:54:42,134 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-06-12 18:54:42,135 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 06:54:42 BoogieIcfgContainer [2021-06-12 18:54:42,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-12 18:54:42,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-12 18:54:42,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-12 18:54:42,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-12 18:54:42,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:54:41" (1/2) ... [2021-06-12 18:54:42,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a61011a and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 06:54:42, skipping insertion in model container [2021-06-12 18:54:42,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 06:54:42" (2/2) ... [2021-06-12 18:54:42,140 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2021-06-12 18:54:42,143 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-12 18:54:42,144 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-12 18:54:42,144 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-12 18:54:42,144 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-12 18:54:42,177 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,177 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,178 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,178 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,178 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,178 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,178 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,178 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,179 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,179 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,180 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,180 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,180 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,181 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,181 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,181 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,185 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,186 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 18:54:42,187 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-12 18:54:42,200 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 18:54:42,213 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 18:54:42,213 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 18:54:42,213 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 18:54:42,213 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 18:54:42,213 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 18:54:42,213 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 18:54:42,213 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 18:54:42,214 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2Thread1of1ForFork2======== [2021-06-12 18:54:42,221 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 107 flow [2021-06-12 18:54:42,351 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1403 states, 1399 states have (on average 3.6125804145818443) internal successors, (5054), 1402 states have internal predecessors, (5054), 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-12 18:54:42,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 1403 states, 1399 states have (on average 3.6125804145818443) internal successors, (5054), 1402 states have internal predecessors, (5054), 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-12 18:54:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-06-12 18:54:42,364 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 18:54:42,364 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 18:54:42,364 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-12 18:54:42,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 18:54:42,372 INFO L82 PathProgramCache]: Analyzing trace with hash -618336958, now seen corresponding path program 1 times [2021-06-12 18:54:42,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 18:54:42,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892494700] [2021-06-12 18:54:42,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 18:54:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 18:54:42,476 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-12 18:54:42,476 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 18:54:42,477 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892494700] [2021-06-12 18:54:42,477 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892494700] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 18:54:42,478 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 18:54:42,478 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-12 18:54:42,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113761127] [2021-06-12 18:54:42,481 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 18:54:42,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 18:54:42,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 18:54:42,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:42,497 INFO L87 Difference]: Start difference. First operand has 1403 states, 1399 states have (on average 3.6125804145818443) internal successors, (5054), 1402 states have internal predecessors, (5054), 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) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-12 18:54:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 18:54:42,562 INFO L93 Difference]: Finished difference Result 398 states and 1386 transitions. [2021-06-12 18:54:42,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 18:54:42,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2021-06-12 18:54:42,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 18:54:42,588 INFO L225 Difference]: With dead ends: 398 [2021-06-12 18:54:42,589 INFO L226 Difference]: Without dead ends: 374 [2021-06-12 18:54:42,590 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-06-12 18:54:42,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 350. [2021-06-12 18:54:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 350 states have (on average 3.5314285714285716) internal successors, (1236), 349 states have internal predecessors, (1236), 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-12 18:54:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1236 transitions. [2021-06-12 18:54:42,666 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1236 transitions. Word has length 9 [2021-06-12 18:54:42,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 18:54:42,667 INFO L482 AbstractCegarLoop]: Abstraction has 350 states and 1236 transitions. [2021-06-12 18:54:42,667 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-12 18:54:42,667 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1236 transitions. [2021-06-12 18:54:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-06-12 18:54:42,669 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 18:54:42,669 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 18:54:42,669 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-12 18:54:42,670 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-12 18:54:42,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 18:54:42,672 INFO L82 PathProgramCache]: Analyzing trace with hash -372247321, now seen corresponding path program 1 times [2021-06-12 18:54:42,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 18:54:42,673 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408653137] [2021-06-12 18:54:42,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 18:54:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 18:54:42,705 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-12 18:54:42,706 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 18:54:42,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408653137] [2021-06-12 18:54:42,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408653137] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 18:54:42,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 18:54:42,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 18:54:42,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202755433] [2021-06-12 18:54:42,709 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 18:54:42,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 18:54:42,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 18:54:42,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:42,711 INFO L87 Difference]: Start difference. First operand 350 states and 1236 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12 18:54:42,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 18:54:42,754 INFO L93 Difference]: Finished difference Result 569 states and 1978 transitions. [2021-06-12 18:54:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 18:54:42,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2021-06-12 18:54:42,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 18:54:42,757 INFO L225 Difference]: With dead ends: 569 [2021-06-12 18:54:42,758 INFO L226 Difference]: Without dead ends: 473 [2021-06-12 18:54:42,759 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:42,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-06-12 18:54:42,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 359. [2021-06-12 18:54:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 359 states have (on average 3.367688022284123) internal successors, (1209), 358 states have internal predecessors, (1209), 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-12 18:54:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1209 transitions. [2021-06-12 18:54:42,780 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1209 transitions. Word has length 12 [2021-06-12 18:54:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 18:54:42,780 INFO L482 AbstractCegarLoop]: Abstraction has 359 states and 1209 transitions. [2021-06-12 18:54:42,780 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12 18:54:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1209 transitions. [2021-06-12 18:54:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-06-12 18:54:42,784 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 18:54:42,785 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 18:54:42,785 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-12 18:54:42,785 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-12 18:54:42,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 18:54:42,786 INFO L82 PathProgramCache]: Analyzing trace with hash 238928219, now seen corresponding path program 2 times [2021-06-12 18:54:42,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 18:54:42,786 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413964082] [2021-06-12 18:54:42,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 18:54:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 18:54:42,812 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-12 18:54:42,813 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 18:54:42,813 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413964082] [2021-06-12 18:54:42,814 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413964082] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 18:54:42,817 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 18:54:42,817 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 18:54:42,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331528277] [2021-06-12 18:54:42,818 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 18:54:42,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 18:54:42,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 18:54:42,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:42,819 INFO L87 Difference]: Start difference. First operand 359 states and 1209 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12 18:54:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 18:54:42,844 INFO L93 Difference]: Finished difference Result 461 states and 1548 transitions. [2021-06-12 18:54:42,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 18:54:42,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2021-06-12 18:54:42,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 18:54:42,846 INFO L225 Difference]: With dead ends: 461 [2021-06-12 18:54:42,846 INFO L226 Difference]: Without dead ends: 461 [2021-06-12 18:54:42,847 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:42,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-06-12 18:54:42,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 415. [2021-06-12 18:54:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 415 states have (on average 3.346987951807229) internal successors, (1389), 414 states have internal predecessors, (1389), 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-12 18:54:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1389 transitions. [2021-06-12 18:54:42,860 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1389 transitions. Word has length 12 [2021-06-12 18:54:42,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 18:54:42,860 INFO L482 AbstractCegarLoop]: Abstraction has 415 states and 1389 transitions. [2021-06-12 18:54:42,860 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12 18:54:42,860 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1389 transitions. [2021-06-12 18:54:42,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-12 18:54:42,861 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 18:54:42,862 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 18:54:42,862 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-12 18:54:42,862 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-12 18:54:42,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 18:54:42,862 INFO L82 PathProgramCache]: Analyzing trace with hash 514367808, now seen corresponding path program 1 times [2021-06-12 18:54:42,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 18:54:42,863 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930317452] [2021-06-12 18:54:42,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 18:54:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 18:54:42,903 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-12 18:54:42,903 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 18:54:42,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930317452] [2021-06-12 18:54:42,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930317452] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 18:54:42,904 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 18:54:42,904 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 18:54:42,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380832139] [2021-06-12 18:54:42,904 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 18:54:42,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 18:54:42,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 18:54:42,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:42,905 INFO L87 Difference]: Start difference. First operand 415 states and 1389 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 18:54:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 18:54:42,931 INFO L93 Difference]: Finished difference Result 487 states and 1625 transitions. [2021-06-12 18:54:42,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 18:54:42,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-12 18:54:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 18:54:42,934 INFO L225 Difference]: With dead ends: 487 [2021-06-12 18:54:42,934 INFO L226 Difference]: Without dead ends: 487 [2021-06-12 18:54:42,935 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:42,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2021-06-12 18:54:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 463. [2021-06-12 18:54:42,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 463 states have (on average 3.32829373650108) internal successors, (1541), 462 states have internal predecessors, (1541), 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-12 18:54:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1541 transitions. [2021-06-12 18:54:42,955 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1541 transitions. Word has length 19 [2021-06-12 18:54:42,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 18:54:42,956 INFO L482 AbstractCegarLoop]: Abstraction has 463 states and 1541 transitions. [2021-06-12 18:54:42,956 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 18:54:42,957 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1541 transitions. [2021-06-12 18:54:42,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-12 18:54:42,957 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 18:54:42,957 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 18:54:42,957 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-12 18:54:42,958 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-12 18:54:42,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 18:54:42,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1752436540, now seen corresponding path program 2 times [2021-06-12 18:54:42,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 18:54:42,958 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703866867] [2021-06-12 18:54:42,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 18:54:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 18:54:42,984 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-12 18:54:42,984 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 18:54:42,984 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703866867] [2021-06-12 18:54:42,984 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703866867] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 18:54:42,984 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 18:54:42,985 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 18:54:42,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802473456] [2021-06-12 18:54:42,985 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 18:54:42,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 18:54:42,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 18:54:42,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:42,987 INFO L87 Difference]: Start difference. First operand 463 states and 1541 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 18:54:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 18:54:43,021 INFO L93 Difference]: Finished difference Result 499 states and 1644 transitions. [2021-06-12 18:54:43,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 18:54:43,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-12 18:54:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 18:54:43,030 INFO L225 Difference]: With dead ends: 499 [2021-06-12 18:54:43,030 INFO L226 Difference]: Without dead ends: 403 [2021-06-12 18:54:43,030 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:43,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-06-12 18:54:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 379. [2021-06-12 18:54:43,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 379 states have (on average 3.2506596306068603) internal successors, (1232), 378 states have internal predecessors, (1232), 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-12 18:54:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1232 transitions. [2021-06-12 18:54:43,038 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1232 transitions. Word has length 19 [2021-06-12 18:54:43,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 18:54:43,038 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1232 transitions. [2021-06-12 18:54:43,038 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 18:54:43,038 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1232 transitions. [2021-06-12 18:54:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-06-12 18:54:43,039 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 18:54:43,039 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 18:54:43,039 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-12 18:54:43,039 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-12 18:54:43,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 18:54:43,039 INFO L82 PathProgramCache]: Analyzing trace with hash 392981523, now seen corresponding path program 1 times [2021-06-12 18:54:43,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 18:54:43,040 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164430021] [2021-06-12 18:54:43,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 18:54:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 18:54:43,079 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-12 18:54:43,079 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 18:54:43,079 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164430021] [2021-06-12 18:54:43,079 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164430021] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 18:54:43,079 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 18:54:43,080 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 18:54:43,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455704324] [2021-06-12 18:54:43,080 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-12 18:54:43,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 18:54:43,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-12 18:54:43,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-12 18:54:43,080 INFO L87 Difference]: Start difference. First operand 379 states and 1232 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 18:54:43,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 18:54:43,100 INFO L93 Difference]: Finished difference Result 398 states and 1271 transitions. [2021-06-12 18:54:43,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-12 18:54:43,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-06-12 18:54:43,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 18:54:43,102 INFO L225 Difference]: With dead ends: 398 [2021-06-12 18:54:43,102 INFO L226 Difference]: Without dead ends: 398 [2021-06-12 18:54:43,103 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 18:54:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-06-12 18:54:43,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2021-06-12 18:54:43,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 398 states have (on average 3.193467336683417) internal successors, (1271), 397 states have internal predecessors, (1271), 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-12 18:54:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1271 transitions. [2021-06-12 18:54:43,110 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1271 transitions. Word has length 26 [2021-06-12 18:54:43,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 18:54:43,110 INFO L482 AbstractCegarLoop]: Abstraction has 398 states and 1271 transitions. [2021-06-12 18:54:43,110 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 18:54:43,110 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1271 transitions. [2021-06-12 18:54:43,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-06-12 18:54:43,111 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 18:54:43,111 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 18:54:43,111 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-12 18:54:43,111 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-12 18:54:43,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 18:54:43,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1909612284, now seen corresponding path program 1 times [2021-06-12 18:54:43,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 18:54:43,112 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754201166] [2021-06-12 18:54:43,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 18:54:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 18:54:43,146 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-12 18:54:43,146 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 18:54:43,146 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754201166] [2021-06-12 18:54:43,146 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754201166] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 18:54:43,146 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 18:54:43,146 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 18:54:43,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303323208] [2021-06-12 18:54:43,147 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-12 18:54:43,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 18:54:43,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-12 18:54:43,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-12 18:54:43,147 INFO L87 Difference]: Start difference. First operand 398 states and 1271 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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-12 18:54:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 18:54:43,175 INFO L93 Difference]: Finished difference Result 416 states and 1310 transitions. [2021-06-12 18:54:43,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-12 18:54:43,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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) Word has length 27 [2021-06-12 18:54:43,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 18:54:43,178 INFO L225 Difference]: With dead ends: 416 [2021-06-12 18:54:43,178 INFO L226 Difference]: Without dead ends: 416 [2021-06-12 18:54:43,178 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 18:54:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-06-12 18:54:43,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2021-06-12 18:54:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 416 states have (on average 3.1490384615384617) internal successors, (1310), 415 states have internal predecessors, (1310), 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-12 18:54:43,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1310 transitions. [2021-06-12 18:54:43,187 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1310 transitions. Word has length 27 [2021-06-12 18:54:43,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 18:54:43,187 INFO L482 AbstractCegarLoop]: Abstraction has 416 states and 1310 transitions. [2021-06-12 18:54:43,187 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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-12 18:54:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1310 transitions. [2021-06-12 18:54:43,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-06-12 18:54:43,188 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 18:54:43,189 INFO L472 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 18:54:43,189 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-12 18:54:43,189 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-12 18:54:43,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 18:54:43,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1445752775, now seen corresponding path program 2 times [2021-06-12 18:54:43,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 18:54:43,191 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798058771] [2021-06-12 18:54:43,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 18:54:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 18:54:43,206 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 18:54:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 18:54:43,211 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 18:54:43,229 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-12 18:54:43,229 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-12 18:54:43,229 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-12 18:54:43,230 INFO L301 ceAbstractionStarter]: Result for error location Process2Thread1of1ForFork2 was UNSAFE (1/5) [2021-06-12 18:54:43,245 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 18:54:43,246 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 18:54:43,246 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 18:54:43,246 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 18:54:43,246 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 18:54:43,246 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 18:54:43,246 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 18:54:43,246 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 18:54:43,246 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2======== [2021-06-12 18:54:43,247 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 107 flow [2021-06-12 18:54:43,295 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1403 states, 1399 states have (on average 3.6125804145818443) internal successors, (5054), 1402 states have internal predecessors, (5054), 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-12 18:54:43,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 1403 states, 1399 states have (on average 3.6125804145818443) internal successors, (5054), 1402 states have internal predecessors, (5054), 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-12 18:54:43,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 18:54:43,302 INFO L301 ceAbstractionStarter]: Result for error location Process2 was SAFE (2/5) [2021-06-12 18:54:43,303 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 18:54:43,304 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 18:54:43,304 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 18:54:43,304 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 18:54:43,304 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 18:54:43,304 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 18:54:43,304 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 18:54:43,304 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 18:54:43,304 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1======== [2021-06-12 18:54:43,306 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 107 flow [2021-06-12 18:54:43,332 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1403 states, 1399 states have (on average 3.6125804145818443) internal successors, (5054), 1402 states have internal predecessors, (5054), 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-12 18:54:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 1403 states, 1399 states have (on average 3.6125804145818443) internal successors, (5054), 1402 states have internal predecessors, (5054), 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-12 18:54:43,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 18:54:43,337 INFO L301 ceAbstractionStarter]: Result for error location Process1 was SAFE (3/5) [2021-06-12 18:54:43,338 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-12 18:54:43,339 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 18:54:43,339 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 18:54:43,339 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 18:54:43,339 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 18:54:43,339 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 18:54:43,339 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 18:54:43,339 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 18:54:43,339 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-12 18:54:43,340 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 107 flow [2021-06-12 18:54:43,374 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1403 states, 1399 states have (on average 3.6125804145818443) internal successors, (5054), 1402 states have internal predecessors, (5054), 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-12 18:54:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 1403 states, 1399 states have (on average 3.6125804145818443) internal successors, (5054), 1402 states have internal predecessors, (5054), 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-12 18:54:43,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 18:54:43,382 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (4/5) [2021-06-12 18:54:43,382 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 18:54:43,383 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 18:54:43,383 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 18:54:43,383 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 18:54:43,383 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 18:54:43,383 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 18:54:43,383 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 18:54:43,384 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 18:54:43,384 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1Thread1of1ForFork1======== [2021-06-12 18:54:43,385 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 107 flow [2021-06-12 18:54:43,408 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1403 states, 1399 states have (on average 3.6125804145818443) internal successors, (5054), 1402 states have internal predecessors, (5054), 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-12 18:54:43,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 1403 states, 1399 states have (on average 3.6125804145818443) internal successors, (5054), 1402 states have internal predecessors, (5054), 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-12 18:54:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-06-12 18:54:43,410 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 18:54:43,410 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 18:54:43,410 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-12 18:54:43,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 18:54:43,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1128325677, now seen corresponding path program 1 times [2021-06-12 18:54:43,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 18:54:43,411 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073231928] [2021-06-12 18:54:43,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 18:54:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 18:54:43,430 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-12 18:54:43,430 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 18:54:43,430 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073231928] [2021-06-12 18:54:43,431 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073231928] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 18:54:43,433 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 18:54:43,433 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-12 18:54:43,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853812255] [2021-06-12 18:54:43,433 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 18:54:43,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 18:54:43,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 18:54:43,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:43,436 INFO L87 Difference]: Start difference. First operand has 1403 states, 1399 states have (on average 3.6125804145818443) internal successors, (5054), 1402 states have internal predecessors, (5054), 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) Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 18:54:43,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 18:54:43,451 INFO L93 Difference]: Finished difference Result 398 states and 1386 transitions. [2021-06-12 18:54:43,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 18:54:43,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-06-12 18:54:43,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 18:54:43,453 INFO L225 Difference]: With dead ends: 398 [2021-06-12 18:54:43,453 INFO L226 Difference]: Without dead ends: 374 [2021-06-12 18:54:43,453 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:43,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-06-12 18:54:43,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 350. [2021-06-12 18:54:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 350 states have (on average 3.5314285714285716) internal successors, (1236), 349 states have internal predecessors, (1236), 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-12 18:54:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1236 transitions. [2021-06-12 18:54:43,460 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1236 transitions. Word has length 8 [2021-06-12 18:54:43,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 18:54:43,460 INFO L482 AbstractCegarLoop]: Abstraction has 350 states and 1236 transitions. [2021-06-12 18:54:43,460 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 18:54:43,460 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1236 transitions. [2021-06-12 18:54:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-06-12 18:54:43,461 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 18:54:43,461 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 18:54:43,461 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-12 18:54:43,461 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-12 18:54:43,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 18:54:43,461 INFO L82 PathProgramCache]: Analyzing trace with hash -356311817, now seen corresponding path program 1 times [2021-06-12 18:54:43,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 18:54:43,461 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505191516] [2021-06-12 18:54:43,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 18:54:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 18:54:43,491 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-12 18:54:43,491 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 18:54:43,491 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505191516] [2021-06-12 18:54:43,491 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505191516] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 18:54:43,492 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 18:54:43,492 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 18:54:43,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853065888] [2021-06-12 18:54:43,492 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 18:54:43,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 18:54:43,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 18:54:43,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:43,492 INFO L87 Difference]: Start difference. First operand 350 states and 1236 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12 18:54:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 18:54:43,510 INFO L93 Difference]: Finished difference Result 569 states and 1978 transitions. [2021-06-12 18:54:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 18:54:43,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2021-06-12 18:54:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 18:54:43,512 INFO L225 Difference]: With dead ends: 569 [2021-06-12 18:54:43,512 INFO L226 Difference]: Without dead ends: 473 [2021-06-12 18:54:43,512 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-06-12 18:54:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 359. [2021-06-12 18:54:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 359 states have (on average 3.367688022284123) internal successors, (1209), 358 states have internal predecessors, (1209), 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-12 18:54:43,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1209 transitions. [2021-06-12 18:54:43,519 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1209 transitions. Word has length 12 [2021-06-12 18:54:43,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 18:54:43,519 INFO L482 AbstractCegarLoop]: Abstraction has 359 states and 1209 transitions. [2021-06-12 18:54:43,519 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12 18:54:43,519 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1209 transitions. [2021-06-12 18:54:43,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-06-12 18:54:43,520 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 18:54:43,520 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 18:54:43,520 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-12 18:54:43,520 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-12 18:54:43,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 18:54:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash 238912363, now seen corresponding path program 2 times [2021-06-12 18:54:43,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 18:54:43,520 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127843870] [2021-06-12 18:54:43,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 18:54:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 18:54:43,541 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-12 18:54:43,542 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 18:54:43,542 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127843870] [2021-06-12 18:54:43,542 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127843870] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 18:54:43,542 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 18:54:43,542 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 18:54:43,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457171634] [2021-06-12 18:54:43,542 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 18:54:43,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 18:54:43,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 18:54:43,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:43,543 INFO L87 Difference]: Start difference. First operand 359 states and 1209 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12 18:54:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 18:54:43,556 INFO L93 Difference]: Finished difference Result 461 states and 1548 transitions. [2021-06-12 18:54:43,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 18:54:43,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2021-06-12 18:54:43,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 18:54:43,558 INFO L225 Difference]: With dead ends: 461 [2021-06-12 18:54:43,558 INFO L226 Difference]: Without dead ends: 461 [2021-06-12 18:54:43,559 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-06-12 18:54:43,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 415. [2021-06-12 18:54:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 415 states have (on average 3.346987951807229) internal successors, (1389), 414 states have internal predecessors, (1389), 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-12 18:54:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1389 transitions. [2021-06-12 18:54:43,575 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1389 transitions. Word has length 12 [2021-06-12 18:54:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 18:54:43,575 INFO L482 AbstractCegarLoop]: Abstraction has 415 states and 1389 transitions. [2021-06-12 18:54:43,575 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12 18:54:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1389 transitions. [2021-06-12 18:54:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-12 18:54:43,576 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 18:54:43,576 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 18:54:43,576 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-12 18:54:43,576 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-12 18:54:43,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 18:54:43,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1239295116, now seen corresponding path program 1 times [2021-06-12 18:54:43,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 18:54:43,577 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111556760] [2021-06-12 18:54:43,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 18:54:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 18:54:43,585 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-12 18:54:43,585 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 18:54:43,585 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111556760] [2021-06-12 18:54:43,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111556760] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 18:54:43,585 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 18:54:43,585 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 18:54:43,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338912514] [2021-06-12 18:54:43,585 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 18:54:43,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 18:54:43,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 18:54:43,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:43,586 INFO L87 Difference]: Start difference. First operand 415 states and 1389 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 18:54:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 18:54:43,605 INFO L93 Difference]: Finished difference Result 487 states and 1625 transitions. [2021-06-12 18:54:43,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 18:54:43,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-12 18:54:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 18:54:43,608 INFO L225 Difference]: With dead ends: 487 [2021-06-12 18:54:43,608 INFO L226 Difference]: Without dead ends: 487 [2021-06-12 18:54:43,608 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:43,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2021-06-12 18:54:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 463. [2021-06-12 18:54:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 463 states have (on average 3.32829373650108) internal successors, (1541), 462 states have internal predecessors, (1541), 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-12 18:54:43,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1541 transitions. [2021-06-12 18:54:43,618 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1541 transitions. Word has length 19 [2021-06-12 18:54:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 18:54:43,618 INFO L482 AbstractCegarLoop]: Abstraction has 463 states and 1541 transitions. [2021-06-12 18:54:43,618 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 18:54:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1541 transitions. [2021-06-12 18:54:43,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-12 18:54:43,619 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 18:54:43,619 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 18:54:43,619 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-12 18:54:43,619 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-12 18:54:43,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 18:54:43,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1752452396, now seen corresponding path program 2 times [2021-06-12 18:54:43,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 18:54:43,619 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490936180] [2021-06-12 18:54:43,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 18:54:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 18:54:43,627 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-12 18:54:43,627 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 18:54:43,627 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490936180] [2021-06-12 18:54:43,627 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490936180] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 18:54:43,627 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 18:54:43,627 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-12 18:54:43,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205350015] [2021-06-12 18:54:43,628 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 18:54:43,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 18:54:43,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 18:54:43,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:43,628 INFO L87 Difference]: Start difference. First operand 463 states and 1541 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 18:54:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 18:54:43,644 INFO L93 Difference]: Finished difference Result 499 states and 1644 transitions. [2021-06-12 18:54:43,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 18:54:43,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-12 18:54:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 18:54:43,646 INFO L225 Difference]: With dead ends: 499 [2021-06-12 18:54:43,646 INFO L226 Difference]: Without dead ends: 403 [2021-06-12 18:54:43,647 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 18:54:43,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-06-12 18:54:43,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 379. [2021-06-12 18:54:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 379 states have (on average 3.2506596306068603) internal successors, (1232), 378 states have internal predecessors, (1232), 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-12 18:54:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1232 transitions. [2021-06-12 18:54:43,655 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1232 transitions. Word has length 19 [2021-06-12 18:54:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 18:54:43,655 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1232 transitions. [2021-06-12 18:54:43,656 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 18:54:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1232 transitions. [2021-06-12 18:54:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-06-12 18:54:43,656 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 18:54:43,656 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 18:54:43,656 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-12 18:54:43,656 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-12 18:54:43,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 18:54:43,657 INFO L82 PathProgramCache]: Analyzing trace with hash 392965667, now seen corresponding path program 1 times [2021-06-12 18:54:43,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 18:54:43,659 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769192852] [2021-06-12 18:54:43,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 18:54:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 18:54:43,687 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-12 18:54:43,687 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 18:54:43,687 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769192852] [2021-06-12 18:54:43,687 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769192852] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 18:54:43,687 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 18:54:43,687 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 18:54:43,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769288095] [2021-06-12 18:54:43,687 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-12 18:54:43,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 18:54:43,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-12 18:54:43,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-12 18:54:43,688 INFO L87 Difference]: Start difference. First operand 379 states and 1232 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 18:54:43,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 18:54:43,709 INFO L93 Difference]: Finished difference Result 398 states and 1273 transitions. [2021-06-12 18:54:43,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-12 18:54:43,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-06-12 18:54:43,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 18:54:43,711 INFO L225 Difference]: With dead ends: 398 [2021-06-12 18:54:43,711 INFO L226 Difference]: Without dead ends: 398 [2021-06-12 18:54:43,711 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 18:54:43,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-06-12 18:54:43,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2021-06-12 18:54:43,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 398 states have (on average 3.198492462311558) internal successors, (1273), 397 states have internal predecessors, (1273), 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-12 18:54:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1273 transitions. [2021-06-12 18:54:43,718 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1273 transitions. Word has length 26 [2021-06-12 18:54:43,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 18:54:43,719 INFO L482 AbstractCegarLoop]: Abstraction has 398 states and 1273 transitions. [2021-06-12 18:54:43,719 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 18:54:43,719 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1273 transitions. [2021-06-12 18:54:43,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-06-12 18:54:43,719 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 18:54:43,719 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 18:54:43,719 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-12 18:54:43,720 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-12 18:54:43,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 18:54:43,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1909628140, now seen corresponding path program 1 times [2021-06-12 18:54:43,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 18:54:43,720 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929281586] [2021-06-12 18:54:43,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 18:54:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 18:54:43,735 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-12 18:54:43,735 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 18:54:43,735 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929281586] [2021-06-12 18:54:43,735 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929281586] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 18:54:43,735 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 18:54:43,735 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-12 18:54:43,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604823474] [2021-06-12 18:54:43,736 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-12 18:54:43,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 18:54:43,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-12 18:54:43,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-12 18:54:43,736 INFO L87 Difference]: Start difference. First operand 398 states and 1273 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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-12 18:54:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 18:54:43,753 INFO L93 Difference]: Finished difference Result 416 states and 1310 transitions. [2021-06-12 18:54:43,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-12 18:54:43,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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) Word has length 27 [2021-06-12 18:54:43,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 18:54:43,755 INFO L225 Difference]: With dead ends: 416 [2021-06-12 18:54:43,755 INFO L226 Difference]: Without dead ends: 416 [2021-06-12 18:54:43,755 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-12 18:54:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-06-12 18:54:43,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2021-06-12 18:54:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 416 states have (on average 3.1490384615384617) internal successors, (1310), 415 states have internal predecessors, (1310), 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-12 18:54:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1310 transitions. [2021-06-12 18:54:43,763 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1310 transitions. Word has length 27 [2021-06-12 18:54:43,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 18:54:43,763 INFO L482 AbstractCegarLoop]: Abstraction has 416 states and 1310 transitions. [2021-06-12 18:54:43,763 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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-12 18:54:43,763 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1310 transitions. [2021-06-12 18:54:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-06-12 18:54:43,764 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 18:54:43,764 INFO L472 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 18:54:43,764 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-12 18:54:43,764 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-12 18:54:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 18:54:43,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1445736919, now seen corresponding path program 2 times [2021-06-12 18:54:43,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 18:54:43,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841521933] [2021-06-12 18:54:43,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 18:54:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 18:54:43,768 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 18:54:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 18:54:43,771 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 18:54:43,773 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-12 18:54:43,773 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-12 18:54:43,773 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-12 18:54:43,773 INFO L301 ceAbstractionStarter]: Result for error location Process1Thread1of1ForFork1 was UNSAFE (5/5) [2021-06-12 18:54:43,773 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-12 18:54:43,798 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.06 06:54:43 BasicIcfg [2021-06-12 18:54:43,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-12 18:54:43,799 INFO L168 Benchmark]: Toolchain (without parser) took 1875.88 ms. Allocated memory was 195.0 MB in the beginning and 249.6 MB in the end (delta: 54.5 MB). Free memory was 175.3 MB in the beginning and 160.9 MB in the end (delta: 14.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 8.0 GB. [2021-06-12 18:54:43,800 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.10 ms. Allocated memory is still 195.0 MB. Free memory is still 176.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-12 18:54:43,800 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.25 ms. Allocated memory is still 195.0 MB. Free memory was 175.2 MB in the beginning and 173.7 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 8.0 GB. [2021-06-12 18:54:43,800 INFO L168 Benchmark]: Boogie Preprocessor took 11.03 ms. Allocated memory is still 195.0 MB. Free memory was 173.7 MB in the beginning and 172.8 MB in the end (delta: 919.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-12 18:54:43,800 INFO L168 Benchmark]: RCFGBuilder took 176.20 ms. Allocated memory is still 195.0 MB. Free memory was 172.7 MB in the beginning and 160.2 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-06-12 18:54:43,802 INFO L168 Benchmark]: TraceAbstraction took 1662.26 ms. Allocated memory was 195.0 MB in the beginning and 249.6 MB in the end (delta: 54.5 MB). Free memory was 159.8 MB in the beginning and 160.9 MB in the end (delta: -1.1 MB). Peak memory consumption was 53.7 MB. Max. memory is 8.0 GB. [2021-06-12 18:54:43,804 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.10 ms. Allocated memory is still 195.0 MB. Free memory is still 176.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 22.25 ms. Allocated memory is still 195.0 MB. Free memory was 175.2 MB in the beginning and 173.7 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 8.0 GB. * Boogie Preprocessor took 11.03 ms. Allocated memory is still 195.0 MB. Free memory was 173.7 MB in the beginning and 172.8 MB in the end (delta: 919.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 176.20 ms. Allocated memory is still 195.0 MB. Free memory was 172.7 MB in the beginning and 160.2 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 1662.26 ms. Allocated memory was 195.0 MB in the beginning and 249.6 MB in the end (delta: 54.5 MB). Free memory was 159.8 MB in the beginning and 160.9 MB in the end (delta: -1.1 MB). Peak memory consumption was 53.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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] [L36] FORK 0 fork 2 Process2(); VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=2, critical=1, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=2, critical=1, deadline=2, deadline=1, 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] [L36] FORK 0 fork 2 Process2(); VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=2, critical=2, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=2, critical=2, deadline=2, deadline=1, 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: 1018.4ms, OverallIterations: 8, TraceHistogramMax: 2, EmptinessCheckTime: 22.8ms, AutomataDifference: 315.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 137.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 300 SDtfs, 141 SDslu, 164 SDs, 0 SdLazy, 86 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 123.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1403occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 144.2ms AutomataMinimizationTime, 7 MinimizatonAttempts, 232 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 17.8ms SsaConstructionTime, 66.4ms SatisfiabilityAnalysisTime, 166.3ms InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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: 55.9ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 6.2ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 49.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1403occurred 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: 33.5ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 5.1ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 27.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1403occurred 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: 43.1ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 7.1ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 35.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1403occurred 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: 390.1ms, OverallIterations: 8, TraceHistogramMax: 2, EmptinessCheckTime: 5.5ms, AutomataDifference: 140.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 24.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 300 SDtfs, 146 SDslu, 164 SDs, 0 SdLazy, 86 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 64.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1403occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 62.8ms AutomataMinimizationTime, 7 MinimizatonAttempts, 232 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 10.6ms SsaConstructionTime, 40.0ms SatisfiabilityAnalysisTime, 69.4ms InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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...