/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/fork_in_loop.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 14:16:10,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 14:16:10,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 14:16:10,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 14:16:10,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 14:16:10,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 14:16:10,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 14:16:10,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 14:16:10,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 14:16:10,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 14:16:10,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 14:16:10,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 14:16:10,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 14:16:10,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 14:16:10,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 14:16:10,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 14:16:10,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 14:16:10,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 14:16:10,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 14:16:10,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 14:16:10,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 14:16:10,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 14:16:10,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 14:16:10,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 14:16:10,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 14:16:10,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 14:16:10,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 14:16:10,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 14:16:10,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 14:16:10,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 14:16:10,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 14:16:10,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 14:16:10,439 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 14:16:10,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 14:16:10,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 14:16:10,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 14:16:10,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 14:16:10,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 14:16:10,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 14:16:10,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 14:16:10,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 14:16:10,442 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-SemanticLbe.epf [2021-03-11 14:16:10,472 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 14:16:10,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 14:16:10,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 14:16:10,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 14:16:10,475 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 14:16:10,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 14:16:10,475 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 14:16:10,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 14:16:10,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 14:16:10,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 14:16:10,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 14:16:10,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 14:16:10,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 14:16:10,476 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 14:16:10,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 14:16:10,476 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 14:16:10,477 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 14:16:10,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 14:16:10,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 14:16:10,477 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 14:16:10,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 14:16:10,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 14:16:10,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 14:16:10,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 14:16:10,478 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 14:16:10,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 14:16:10,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 14:16:10,478 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-11 14:16:10,478 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-03-11 14:16:10,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 14:16:10,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 14:16:10,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 14:16:10,728 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-11 14:16:10,729 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-11 14:16:10,729 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/fork_in_loop.bpl [2021-03-11 14:16:10,729 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/fork_in_loop.bpl' [2021-03-11 14:16:10,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 14:16:10,763 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-11 14:16:10,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 14:16:10,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 14:16:10,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 14:16:10,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:16:10" (1/1) ... [2021-03-11 14:16:10,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:16:10" (1/1) ... [2021-03-11 14:16:10,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 14:16:10,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 14:16:10,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 14:16:10,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 14:16:10,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:16:10" (1/1) ... [2021-03-11 14:16:10,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:16:10" (1/1) ... [2021-03-11 14:16:10,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:16:10" (1/1) ... [2021-03-11 14:16:10,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:16:10" (1/1) ... [2021-03-11 14:16:10,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:16:10" (1/1) ... [2021-03-11 14:16:10,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:16:10" (1/1) ... [2021-03-11 14:16:10,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:16:10" (1/1) ... [2021-03-11 14:16:10,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 14:16:10,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 14:16:10,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 14:16:10,800 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 14:16:10,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:16:10" (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-03-11 14:16:10,851 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2021-03-11 14:16:10,852 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2021-03-11 14:16:10,852 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2021-03-11 14:16:10,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 14:16:10,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 14:16:10,853 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 14:16:10,988 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 14:16:10,988 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-03-11 14:16:10,990 INFO L202 PluginConnector]: Adding new model fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:16:10 BoogieIcfgContainer [2021-03-11 14:16:10,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 14:16:10,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 14:16:10,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 14:16:10,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 14:16:10,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:16:10" (1/2) ... [2021-03-11 14:16:10,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b6d0a3 and model type fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 02:16:10, skipping insertion in model container [2021-03-11 14:16:10,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:16:10" (2/2) ... [2021-03-11 14:16:10,996 INFO L111 eAbstractionObserver]: Analyzing ICFG fork_in_loop.bpl [2021-03-11 14:16:11,002 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-11 14:16:11,003 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 14:16:11,005 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-11 14:16:11,006 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 14:16:11,030 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,031 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,031 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,031 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,034 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,048 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,062 INFO L149 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2021-03-11 14:16:11,074 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-03-11 14:16:11,104 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:16:11,104 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:16:11,104 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:16:11,104 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:16:11,104 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:16:11,104 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:16:11,104 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:16:11,104 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:16:11,116 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:16:11,123 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 78 flow [2021-03-11 14:16:11,126 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 78 flow [2021-03-11 14:16:11,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 78 flow [2021-03-11 14:16:11,143 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-11 14:16:11,143 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-11 14:16:11,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 23 events. 0/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-11 14:16:11,147 INFO L116 LiptonReduction]: Number of co-enabled transitions 36 [2021-03-11 14:16:11,265 INFO L131 LiptonReduction]: Checked pairs total: 74 [2021-03-11 14:16:11,266 INFO L133 LiptonReduction]: Total number of compositions: 4 [2021-03-11 14:16:11,271 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 21 transitions, 70 flow [2021-03-11 14:16:11,276 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 27 states have internal predecessors, (35), 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-03-11 14:16:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 27 states have internal predecessors, (35), 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-03-11 14:16:11,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-03-11 14:16:11,280 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:16:11,280 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2021-03-11 14:16:11,281 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:16:11,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:16:11,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1921556130, now seen corresponding path program 1 times [2021-03-11 14:16:11,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:16:11,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385405585] [2021-03-11 14:16:11,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:16:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:16:11,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:16:11,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:16:11,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:16:11,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:16:11,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:16:11,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 14:16:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:16:11,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385405585] [2021-03-11 14:16:11,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:16:11,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 14:16:11,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5770599] [2021-03-11 14:16:11,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 14:16:11,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:16:11,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 14:16:11,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 14:16:11,404 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 27 states have internal predecessors, (35), 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 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-03-11 14:16:11,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:16:11,442 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-03-11 14:16:11,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 14:16:11,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2021-03-11 14:16:11,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:16:11,447 INFO L225 Difference]: With dead ends: 24 [2021-03-11 14:16:11,447 INFO L226 Difference]: Without dead ends: 19 [2021-03-11 14:16:11,448 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 14:16:11,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-03-11 14:16:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-03-11 14:16:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:16:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-03-11 14:16:11,465 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 6 [2021-03-11 14:16:11,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:16:11,465 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-03-11 14:16:11,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-03-11 14:16:11,465 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2021-03-11 14:16:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-03-11 14:16:11,466 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:16:11,466 INFO L519 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:16:11,466 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 14:16:11,466 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:16:11,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:16:11,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1005922435, now seen corresponding path program 1 times [2021-03-11 14:16:11,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:16:11,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351246224] [2021-03-11 14:16:11,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:16:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:16:11,475 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:16:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:16:11,481 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:16:11,489 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:16:11,489 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:16:11,490 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 14:16:11,490 WARN L342 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:16:11,490 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-03-11 14:16:11,495 WARN L313 ript$VariableManager]: TermVariabe fooThread1of2ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,495 WARN L313 ript$VariableManager]: TermVariabe fooThread1of2ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,495 WARN L313 ript$VariableManager]: TermVariabe fooThread2of2ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,495 WARN L313 ript$VariableManager]: TermVariabe fooThread2of2ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,495 WARN L313 ript$VariableManager]: TermVariabe fooThread1of2ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,495 WARN L313 ript$VariableManager]: TermVariabe fooThread1of2ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,496 WARN L313 ript$VariableManager]: TermVariabe fooThread2of2ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,496 WARN L313 ript$VariableManager]: TermVariabe fooThread2of2ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,496 WARN L313 ript$VariableManager]: TermVariabe fooThread1of2ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,497 WARN L313 ript$VariableManager]: TermVariabe fooThread2of2ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,498 WARN L313 ript$VariableManager]: TermVariabe fooThread1of2ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,499 WARN L313 ript$VariableManager]: TermVariabe fooThread2of2ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 14:16:11,506 INFO L149 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2021-03-11 14:16:11,506 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-03-11 14:16:11,507 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:16:11,507 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:16:11,507 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:16:11,507 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:16:11,507 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:16:11,507 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:16:11,507 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:16:11,507 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:16:11,508 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:16:11,508 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 37 transitions, 134 flow [2021-03-11 14:16:11,508 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 37 transitions, 134 flow [2021-03-11 14:16:11,508 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 37 transitions, 134 flow [2021-03-11 14:16:11,526 INFO L129 PetriNetUnfolder]: 14/111 cut-off events. [2021-03-11 14:16:11,527 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-03-11 14:16:11,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 111 events. 14/111 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 402 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 80. Up to 15 conditions per place. [2021-03-11 14:16:11,530 INFO L116 LiptonReduction]: Number of co-enabled transitions 312 [2021-03-11 14:16:11,574 INFO L131 LiptonReduction]: Checked pairs total: 503 [2021-03-11 14:16:11,574 INFO L133 LiptonReduction]: Total number of compositions: 6 [2021-03-11 14:16:11,575 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 31 transitions, 122 flow [2021-03-11 14:16:11,593 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 243 states, 226 states have (on average 2.172566371681416) internal successors, (491), 242 states have internal predecessors, (491), 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-03-11 14:16:11,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 243 states, 226 states have (on average 2.172566371681416) internal successors, (491), 242 states have internal predecessors, (491), 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-03-11 14:16:11,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-03-11 14:16:11,594 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:16:11,595 INFO L519 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2021-03-11 14:16:11,595 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:16:11,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:16:11,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1774446021, now seen corresponding path program 1 times [2021-03-11 14:16:11,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:16:11,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823901676] [2021-03-11 14:16:11,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:16:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:16:11,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:16:11,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:16:11,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:16:11,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:16:11,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:16:11,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 14:16:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-11 14:16:11,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823901676] [2021-03-11 14:16:11,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:16:11,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 14:16:11,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139737799] [2021-03-11 14:16:11,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 14:16:11,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:16:11,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 14:16:11,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 14:16:11,641 INFO L87 Difference]: Start difference. First operand has 243 states, 226 states have (on average 2.172566371681416) internal successors, (491), 242 states have internal predecessors, (491), 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 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-03-11 14:16:11,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:16:11,681 INFO L93 Difference]: Finished difference Result 48 states and 73 transitions. [2021-03-11 14:16:11,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 14:16:11,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-03-11 14:16:11,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:16:11,682 INFO L225 Difference]: With dead ends: 48 [2021-03-11 14:16:11,682 INFO L226 Difference]: Without dead ends: 43 [2021-03-11 14:16:11,682 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 14:16:11,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-03-11 14:16:11,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-03-11 14:16:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 42 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:16:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2021-03-11 14:16:11,687 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 9 [2021-03-11 14:16:11,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:16:11,687 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2021-03-11 14:16:11,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-03-11 14:16:11,687 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2021-03-11 14:16:11,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-03-11 14:16:11,688 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:16:11,688 INFO L519 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:16:11,688 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 14:16:11,688 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:16:11,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:16:11,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1383688457, now seen corresponding path program 1 times [2021-03-11 14:16:11,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:16:11,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210586600] [2021-03-11 14:16:11,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:16:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:16:11,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:16:11,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 14:16:11,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:16:11,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:16:11,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:16:11,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:16:11,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:16:11,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:16:11,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:16:11,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 14:16:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-11 14:16:11,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210586600] [2021-03-11 14:16:11,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:16:11,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 14:16:11,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186061960] [2021-03-11 14:16:11,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 14:16:11,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:16:11,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 14:16:11,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-11 14:16:11,729 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:16:11,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:16:11,753 INFO L93 Difference]: Finished difference Result 35 states and 51 transitions. [2021-03-11 14:16:11,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 14:16:11,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-03-11 14:16:11,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:16:11,756 INFO L225 Difference]: With dead ends: 35 [2021-03-11 14:16:11,756 INFO L226 Difference]: Without dead ends: 35 [2021-03-11 14:16:11,756 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-11 14:16:11,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-03-11 14:16:11,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-03-11 14:16:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:16:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 51 transitions. [2021-03-11 14:16:11,760 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 51 transitions. Word has length 15 [2021-03-11 14:16:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:16:11,760 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 51 transitions. [2021-03-11 14:16:11,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:16:11,760 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 51 transitions. [2021-03-11 14:16:11,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-11 14:16:11,761 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:16:11,761 INFO L519 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:16:11,761 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 14:16:11,761 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:16:11,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:16:11,761 INFO L82 PathProgramCache]: Analyzing trace with hash 956991948, now seen corresponding path program 1 times [2021-03-11 14:16:11,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:16:11,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846976651] [2021-03-11 14:16:11,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:16:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:16:11,769 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:16:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:16:11,791 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:16:11,794 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:16:11,794 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:16:11,794 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 14:16:11,806 INFO L202 PluginConnector]: Adding new model fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 02:16:11 BasicIcfg [2021-03-11 14:16:11,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 14:16:11,807 INFO L168 Benchmark]: Toolchain (without parser) took 1048.05 ms. Allocated memory was 255.9 MB in the beginning and 360.7 MB in the end (delta: 104.9 MB). Free memory was 236.6 MB in the beginning and 323.8 MB in the end (delta: -87.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.0 GB. [2021-03-11 14:16:11,808 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.08 ms. Allocated memory is still 255.9 MB. Free memory was 237.7 MB in the beginning and 237.5 MB in the end (delta: 162.9 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 14:16:11,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.21 ms. Allocated memory is still 255.9 MB. Free memory was 236.0 MB in the beginning and 234.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 14:16:11,808 INFO L168 Benchmark]: Boogie Preprocessor took 14.68 ms. Allocated memory is still 255.9 MB. Free memory was 234.6 MB in the beginning and 233.6 MB in the end (delta: 923.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 14:16:11,809 INFO L168 Benchmark]: RCFGBuilder took 189.94 ms. Allocated memory is still 255.9 MB. Free memory was 233.6 MB in the beginning and 240.1 MB in the end (delta: -6.5 MB). Peak memory consumption was 17.4 MB. Max. memory is 16.0 GB. [2021-03-11 14:16:11,809 INFO L168 Benchmark]: TraceAbstraction took 814.71 ms. Allocated memory was 255.9 MB in the beginning and 360.7 MB in the end (delta: 104.9 MB). Free memory was 240.1 MB in the beginning and 323.8 MB in the end (delta: -83.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 16.0 GB. [2021-03-11 14:16:11,811 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.08 ms. Allocated memory is still 255.9 MB. Free memory was 237.7 MB in the beginning and 237.5 MB in the end (delta: 162.9 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 20.21 ms. Allocated memory is still 255.9 MB. Free memory was 236.0 MB in the beginning and 234.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 14.68 ms. Allocated memory is still 255.9 MB. Free memory was 234.6 MB in the beginning and 233.6 MB in the end (delta: 923.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 189.94 ms. Allocated memory is still 255.9 MB. Free memory was 233.6 MB in the beginning and 240.1 MB in the end (delta: -6.5 MB). Peak memory consumption was 17.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 814.71 ms. Allocated memory was 255.9 MB in the beginning and 360.7 MB in the end (delta: 104.9 MB). Free memory was 240.1 MB in the beginning and 323.8 MB in the end (delta: -83.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 140.3ms, 27 PlacesBefore, 23 PlacesAfterwards, 25 TransitionsBefore, 21 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 74 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 74, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 28, unknown conditional: 0, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 66.1ms, 37 PlacesBefore, 31 PlacesAfterwards, 37 TransitionsBefore, 31 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 503 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 503, positive: 503, positive conditional: 0, positive unconditional: 503, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 212, positive: 212, positive conditional: 0, positive unconditional: 212, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 212, positive: 212, positive conditional: 0, positive unconditional: 212, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 503, positive: 291, positive conditional: 0, positive unconditional: 291, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 212, unknown conditional: 0, unknown unconditional: 212] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - CounterExampleResult [Line: 35]: assertion can be violated assertion can be violated We found a FailurePath: [L20] 0 x := 1; VAL [x=1] [L22] COND TRUE 0 x < 2 VAL [x=1] [L23] FORK 0 fork x foo(x); VAL [i=1, x=1] [L24] 0 x := x + 1; VAL [i=1, x=2] [L42] 1 y := 4; [L22] COND FALSE 0 !(x < 2) [L26] 0 x := 1; VAL [i=1, x=1, y=4] [L27] JOIN 1 join x; VAL [i=1, x=1, y=4] [L28] COND TRUE 0 x < 3 VAL [i=1, x=1, y=4] [L29] FORK 0 fork x foo(x); VAL [i=1, x=1, y=4] [L30] 0 x := x + 1; VAL [i=1, x=2, y=4] [L28] COND TRUE 0 x < 3 VAL [i=1, x=2, y=4] [L29] FORK 0 fork x foo(x); VAL [i=2, x=2, y=4] [L30] 0 x := x + 1; VAL [i=2, x=3, y=4] [L28] COND FALSE 0 !(x < 3) VAL [i=2, x=3, y=4] [L42] 2 y := 4; [L33] JOIN 2 join 1; VAL [i=2, x=3, y=4] [L42] 3 y := 4; [L34] JOIN 3 join 2; VAL [i=2, x=3, y=4] [L35] 0 assert false; VAL [i=2, x=3, y=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 2 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 675.7ms, OverallIterations: 5, TraceHistogramMax: 3, EmptinessCheckTime: 6.3ms, AutomataDifference: 126.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 257.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 32 SDtfs, 67 SDslu, 9 SDs, 0 SdLazy, 65 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 63.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 16.2ms AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 7.7ms SsaConstructionTime, 31.2ms SatisfiabilityAnalysisTime, 103.1ms InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 59 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 17/17 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...