/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-PN-NoLbe-OGIterative.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 03:15:22,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 03:15:22,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 03:15:22,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 03:15:22,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 03:15:22,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 03:15:22,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 03:15:22,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 03:15:22,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 03:15:22,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 03:15:22,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 03:15:22,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 03:15:22,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 03:15:22,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 03:15:22,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 03:15:22,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 03:15:22,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 03:15:22,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 03:15:22,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 03:15:22,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 03:15:22,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 03:15:22,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 03:15:22,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 03:15:22,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 03:15:22,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 03:15:22,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 03:15:22,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 03:15:22,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 03:15:22,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 03:15:22,552 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 03:15:22,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 03:15:22,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 03:15:22,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 03:15:22,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 03:15:22,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 03:15:22,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 03:15:22,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 03:15:22,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 03:15:22,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 03:15:22,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 03:15:22,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 03:15:22,557 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-PN-NoLbe-OGIterative.epf [2021-08-13 03:15:22,575 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 03:15:22,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 03:15:22,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 03:15:22,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 03:15:22,576 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 03:15:22,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 03:15:22,577 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 03:15:22,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 03:15:22,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 03:15:22,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 03:15:22,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 03:15:22,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 03:15:22,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 03:15:22,578 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 03:15:22,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 03:15:22,578 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 03:15:22,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 03:15:22,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 03:15:22,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 03:15:22,579 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 03:15:22,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 03:15:22,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 03:15:22,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 03:15:22,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 03:15:22,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 03:15:22,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 03:15:22,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 03:15:22,580 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 03:15:22,580 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 03:15:22,581 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 03:15:22,581 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 03:15:22,581 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-08-13 03:15:22,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 03:15:22,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 03:15:22,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 03:15:22,923 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-08-13 03:15:22,926 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-08-13 03:15:22,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl [2021-08-13 03:15:22,928 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl' [2021-08-13 03:15:23,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 03:15:23,335 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-08-13 03:15:23,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 03:15:23,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 03:15:23,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 03:15:23,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 03:15:23" (1/1) ... [2021-08-13 03:15:23,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 03:15:23" (1/1) ... [2021-08-13 03:15:23,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 03:15:23,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 03:15:23,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 03:15:23,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 03:15:23,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 03:15:23" (1/1) ... [2021-08-13 03:15:23,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 03:15:23" (1/1) ... [2021-08-13 03:15:23,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 03:15:23" (1/1) ... [2021-08-13 03:15:23,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 03:15:23" (1/1) ... [2021-08-13 03:15:23,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 03:15:23" (1/1) ... [2021-08-13 03:15:23,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 03:15:23" (1/1) ... [2021-08-13 03:15:23,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 03:15:23" (1/1) ... [2021-08-13 03:15:23,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 03:15:23,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 03:15:23,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 03:15:23,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 03:15:23,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 03:15:23" (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-08-13 03:15:23,467 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-08-13 03:15:23,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-08-13 03:15:23,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-08-13 03:15:23,468 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-08-13 03:15:23,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-08-13 03:15:23,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-08-13 03:15:23,468 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-08-13 03:15:23,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 03:15:23,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 03:15:23,469 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-08-13 03:15:23,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-08-13 03:15:23,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-08-13 03:15:23,469 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-08-13 03:15:23,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-08-13 03:15:23,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-08-13 03:15:23,469 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2021-08-13 03:15:23,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2021-08-13 03:15:23,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2021-08-13 03:15:23,470 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2021-08-13 03:15:23,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2021-08-13 03:15:23,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2021-08-13 03:15:23,471 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-13 03:15:23,776 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 03:15:23,777 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-13 03:15:23,778 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 03:15:23 BoogieIcfgContainer [2021-08-13 03:15:23,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 03:15:23,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 03:15:23,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 03:15:23,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 03:15:23,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 03:15:23" (1/2) ... [2021-08-13 03:15:23,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@caef0b8 and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 03:15:23, skipping insertion in model container [2021-08-13 03:15:23,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 03:15:23" (2/2) ... [2021-08-13 03:15:23,785 INFO L111 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2021-08-13 03:15:23,810 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 03:15:23,810 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-13 03:15:23,811 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 03:15:23,983 INFO L149 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2021-08-13 03:15:24,004 INFO L255 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-08-13 03:15:24,035 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 03:15:24,035 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 03:15:24,035 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 03:15:24,035 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 03:15:24,036 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 03:15:24,036 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 03:15:24,036 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 03:15:24,036 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 03:15:24,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 73 transitions, 218 flow [2021-08-13 03:15:24,109 INFO L129 PetriNetUnfolder]: 8/61 cut-off events. [2021-08-13 03:15:24,109 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-08-13 03:15:24,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 61 events. 8/61 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 190 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 71. Up to 3 conditions per place. [2021-08-13 03:15:24,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 73 transitions, 218 flow [2021-08-13 03:15:24,116 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 59 transitions, 166 flow [2021-08-13 03:15:24,129 INFO L129 PetriNetUnfolder]: 8/58 cut-off events. [2021-08-13 03:15:24,129 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-08-13 03:15:24,130 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 03:15:24,130 INFO L266 CegarLoopForPetriNet]: 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] [2021-08-13 03:15:24,131 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err3INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-08-13 03:15:24,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 03:15:24,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1236506362, now seen corresponding path program 1 times [2021-08-13 03:15:24,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 03:15:24,142 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590007103] [2021-08-13 03:15:24,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 03:15:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 03:15:24,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 03:15:24,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 03:15:24,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 03:15:24,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 03:15:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 03:15:24,291 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 03:15:24,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590007103] [2021-08-13 03:15:24,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590007103] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 03:15:24,292 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 03:15:24,293 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 03:15:24,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133228503] [2021-08-13 03:15:24,300 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 03:15:24,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 03:15:24,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 03:15:24,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 03:15:24,316 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 77 [2021-08-13 03:15:24,321 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-08-13 03:15:24,321 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 03:15:24,321 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 77 [2021-08-13 03:15:24,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 03:15:24,801 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([203] thread4EXIT-->L119: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar0_4 4) (= v_thread4Thread1of1ForFork3_thidvar3_4 4) (= v_thread4Thread1of1ForFork3_thidvar1_4 4) (= v_thread4Thread1of1ForFork3_thidvar2_4 4)) InVars {thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} AuxVars[] AssignedVars[][60], [80#true, 82#true, 84#true, 86#true, 88#true, 72#L119true, 76#true, 78#true]) [2021-08-13 03:15:24,801 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-08-13 03:15:24,802 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2021-08-13 03:15:24,802 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2021-08-13 03:15:24,803 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-08-13 03:15:24,833 INFO L129 PetriNetUnfolder]: 1975/3929 cut-off events. [2021-08-13 03:15:24,833 INFO L130 PetriNetUnfolder]: For 154/154 co-relation queries the response was YES. [2021-08-13 03:15:24,854 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6572 conditions, 3929 events. 1975/3929 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 29013 event pairs, 737 based on Foata normal form. 1/3650 useless extension candidates. Maximal degree in co-relation 6543. Up to 2309 conditions per place. [2021-08-13 03:15:24,884 INFO L132 encePairwiseOnDemand]: 71/77 looper letters, 21 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2021-08-13 03:15:24,884 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 234 flow [2021-08-13 03:15:24,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 03:15:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 03:15:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2021-08-13 03:15:24,897 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8701298701298701 [2021-08-13 03:15:24,897 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 201 transitions. [2021-08-13 03:15:24,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 201 transitions. [2021-08-13 03:15:24,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 03:15:24,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 201 transitions. [2021-08-13 03:15:24,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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-08-13 03:15:24,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-08-13 03:15:24,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-08-13 03:15:24,915 INFO L348 CegarLoopForPetriNet]: 70 programPoint places, 2 predicate places. [2021-08-13 03:15:24,915 INFO L482 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 234 flow [2021-08-13 03:15:24,915 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-08-13 03:15:24,916 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 03:15:24,916 INFO L266 CegarLoopForPetriNet]: 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, 1, 1, 1, 1] [2021-08-13 03:15:24,916 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 03:15:24,916 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err3INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-08-13 03:15:24,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 03:15:24,917 INFO L82 PathProgramCache]: Analyzing trace with hash -716341331, now seen corresponding path program 1 times [2021-08-13 03:15:24,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 03:15:24,918 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429503235] [2021-08-13 03:15:24,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 03:15:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 03:15:24,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 03:15:25,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 03:15:25,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 03:15:25,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-08-13 03:15:25,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 03:15:25,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 03:15:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 03:15:25,015 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 03:15:25,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429503235] [2021-08-13 03:15:25,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429503235] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 03:15:25,015 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 03:15:25,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-13 03:15:25,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822163467] [2021-08-13 03:15:25,017 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 03:15:25,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 03:15:25,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 03:15:25,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 03:15:25,027 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 77 [2021-08-13 03:15:25,028 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-08-13 03:15:25,028 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 03:15:25,028 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 77 [2021-08-13 03:15:25,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 03:15:25,414 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([203] thread4EXIT-->L119: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar0_4 4) (= v_thread4Thread1of1ForFork3_thidvar3_4 4) (= v_thread4Thread1of1ForFork3_thidvar1_4 4) (= v_thread4Thread1of1ForFork3_thidvar2_4 4)) InVars {thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} AuxVars[] AssignedVars[][56], [80#true, 82#true, 84#true, 86#true, 88#true, 72#L119true, 76#true, 78#true, 94#(not f2_3)]) [2021-08-13 03:15:25,415 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-08-13 03:15:25,415 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2021-08-13 03:15:25,415 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2021-08-13 03:15:25,415 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-08-13 03:15:25,571 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([203] thread4EXIT-->L119: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar0_4 4) (= v_thread4Thread1of1ForFork3_thidvar3_4 4) (= v_thread4Thread1of1ForFork3_thidvar1_4 4) (= v_thread4Thread1of1ForFork3_thidvar2_4 4)) InVars {thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} AuxVars[] AssignedVars[][56], [80#true, 82#true, 84#true, 86#true, 88#true, 72#L119true, 76#true, 78#true, 94#(not f2_3)]) [2021-08-13 03:15:25,572 INFO L384 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2021-08-13 03:15:25,572 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-08-13 03:15:25,573 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-08-13 03:15:25,573 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-08-13 03:15:25,575 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-08-13 03:15:25,583 INFO L129 PetriNetUnfolder]: 2654/4997 cut-off events. [2021-08-13 03:15:25,583 INFO L130 PetriNetUnfolder]: For 191/191 co-relation queries the response was YES. [2021-08-13 03:15:25,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8906 conditions, 4997 events. 2654/4997 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 35714 event pairs, 1188 based on Foata normal form. 108/4772 useless extension candidates. Maximal degree in co-relation 8874. Up to 3168 conditions per place. [2021-08-13 03:15:25,638 INFO L132 encePairwiseOnDemand]: 72/77 looper letters, 3 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2021-08-13 03:15:25,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 252 flow [2021-08-13 03:15:25,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 03:15:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 03:15:25,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2021-08-13 03:15:25,644 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9567099567099567 [2021-08-13 03:15:25,644 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 221 transitions. [2021-08-13 03:15:25,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 221 transitions. [2021-08-13 03:15:25,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 03:15:25,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 221 transitions. [2021-08-13 03:15:25,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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-08-13 03:15:25,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-08-13 03:15:25,648 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-08-13 03:15:25,649 INFO L348 CegarLoopForPetriNet]: 70 programPoint places, 4 predicate places. [2021-08-13 03:15:25,649 INFO L482 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 252 flow [2021-08-13 03:15:25,649 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-08-13 03:15:25,649 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 03:15:25,649 INFO L266 CegarLoopForPetriNet]: 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, 1, 1, 1, 1] [2021-08-13 03:15:25,650 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 03:15:25,650 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err3INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-08-13 03:15:25,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 03:15:25,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1221373621, now seen corresponding path program 1 times [2021-08-13 03:15:25,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 03:15:25,653 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336565708] [2021-08-13 03:15:25,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 03:15:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 03:15:25,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 03:15:25,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 03:15:25,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 03:15:25,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-08-13 03:15:25,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 03:15:25,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 03:15:25,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 03:15:25,702 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 03:15:25,702 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336565708] [2021-08-13 03:15:25,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336565708] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 03:15:25,702 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 03:15:25,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-13 03:15:25,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752362156] [2021-08-13 03:15:25,704 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 03:15:25,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 03:15:25,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 03:15:25,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 03:15:25,705 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 77 [2021-08-13 03:15:25,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-08-13 03:15:25,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 03:15:25,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 77 [2021-08-13 03:15:25,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 03:15:26,187 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([203] thread4EXIT-->L119: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar0_4 4) (= v_thread4Thread1of1ForFork3_thidvar3_4 4) (= v_thread4Thread1of1ForFork3_thidvar1_4 4) (= v_thread4Thread1of1ForFork3_thidvar2_4 4)) InVars {thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} AuxVars[] AssignedVars[][53], [80#true, 98#(not f2_11), 82#true, 84#true, 86#true, 88#true, 72#L119true, 76#true, 94#(not f2_3), 78#true]) [2021-08-13 03:15:26,187 INFO L384 tUnfolder$Statistics]: this new event has 45 ancestors and is cut-off event [2021-08-13 03:15:26,187 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-08-13 03:15:26,187 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-08-13 03:15:26,188 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-08-13 03:15:26,278 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([203] thread4EXIT-->L119: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar0_4 4) (= v_thread4Thread1of1ForFork3_thidvar3_4 4) (= v_thread4Thread1of1ForFork3_thidvar1_4 4) (= v_thread4Thread1of1ForFork3_thidvar2_4 4)) InVars {thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} AuxVars[] AssignedVars[][53], [80#true, 98#(not f2_11), 82#true, 84#true, 86#true, 72#L119true, 88#true, 76#true, 94#(not f2_3), 78#true]) [2021-08-13 03:15:26,279 INFO L384 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2021-08-13 03:15:26,279 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-08-13 03:15:26,279 INFO L387 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2021-08-13 03:15:26,279 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-08-13 03:15:26,279 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-08-13 03:15:26,299 INFO L129 PetriNetUnfolder]: 3696/6924 cut-off events. [2021-08-13 03:15:26,300 INFO L130 PetriNetUnfolder]: For 304/304 co-relation queries the response was YES. [2021-08-13 03:15:26,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12683 conditions, 6924 events. 3696/6924 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 50635 event pairs, 1867 based on Foata normal form. 169/6596 useless extension candidates. Maximal degree in co-relation 12650. Up to 4394 conditions per place. [2021-08-13 03:15:26,374 INFO L132 encePairwiseOnDemand]: 72/77 looper letters, 3 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2021-08-13 03:15:26,375 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 270 flow [2021-08-13 03:15:26,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 03:15:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 03:15:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2021-08-13 03:15:26,377 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9567099567099567 [2021-08-13 03:15:26,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 221 transitions. [2021-08-13 03:15:26,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 221 transitions. [2021-08-13 03:15:26,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 03:15:26,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 221 transitions. [2021-08-13 03:15:26,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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-08-13 03:15:26,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-08-13 03:15:26,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-08-13 03:15:26,380 INFO L348 CegarLoopForPetriNet]: 70 programPoint places, 6 predicate places. [2021-08-13 03:15:26,381 INFO L482 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 270 flow [2021-08-13 03:15:26,381 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-08-13 03:15:26,381 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 03:15:26,381 INFO L266 CegarLoopForPetriNet]: 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, 1, 1, 1, 1] [2021-08-13 03:15:26,381 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 03:15:26,381 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err3INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-08-13 03:15:26,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 03:15:26,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1903520547, now seen corresponding path program 1 times [2021-08-13 03:15:26,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 03:15:26,382 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262388584] [2021-08-13 03:15:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 03:15:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 03:15:26,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 03:15:26,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 03:15:26,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 03:15:26,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-08-13 03:15:26,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 03:15:26,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 03:15:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 03:15:26,419 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 03:15:26,420 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262388584] [2021-08-13 03:15:26,420 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262388584] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 03:15:26,420 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 03:15:26,420 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-13 03:15:26,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151383872] [2021-08-13 03:15:26,421 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 03:15:26,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 03:15:26,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 03:15:26,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 03:15:26,423 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 77 [2021-08-13 03:15:26,424 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-08-13 03:15:26,424 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 03:15:26,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 77 [2021-08-13 03:15:26,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 03:15:27,042 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([203] thread4EXIT-->L119: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar0_4 4) (= v_thread4Thread1of1ForFork3_thidvar3_4 4) (= v_thread4Thread1of1ForFork3_thidvar1_4 4) (= v_thread4Thread1of1ForFork3_thidvar2_4 4)) InVars {thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_4, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_4, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_4, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_4} AuxVars[] AssignedVars[][50], [80#true, 82#true, 98#(not f2_11), 84#true, 86#true, 102#(not f1_2), 88#true, 72#L119true, 76#true, 94#(not f2_3), 78#true]) [2021-08-13 03:15:27,042 INFO L384 tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event [2021-08-13 03:15:27,042 INFO L387 tUnfolder$Statistics]: existing Event has 45 ancestors and is cut-off event [2021-08-13 03:15:27,042 INFO L387 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2021-08-13 03:15:27,042 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-08-13 03:15:27,106 INFO L129 PetriNetUnfolder]: 3810/7264 cut-off events. [2021-08-13 03:15:27,107 INFO L130 PetriNetUnfolder]: For 337/337 co-relation queries the response was YES. [2021-08-13 03:15:27,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13613 conditions, 7264 events. 3810/7264 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 55748 event pairs, 2197 based on Foata normal form. 76/6740 useless extension candidates. Maximal degree in co-relation 13581. Up to 4449 conditions per place. [2021-08-13 03:15:27,185 INFO L132 encePairwiseOnDemand]: 72/77 looper letters, 3 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2021-08-13 03:15:27,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 73 transitions, 288 flow [2021-08-13 03:15:27,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 03:15:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 03:15:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2021-08-13 03:15:27,190 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9567099567099567 [2021-08-13 03:15:27,190 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 221 transitions. [2021-08-13 03:15:27,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 221 transitions. [2021-08-13 03:15:27,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 03:15:27,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 221 transitions. [2021-08-13 03:15:27,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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-08-13 03:15:27,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-08-13 03:15:27,193 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-08-13 03:15:27,193 INFO L348 CegarLoopForPetriNet]: 70 programPoint places, 8 predicate places. [2021-08-13 03:15:27,194 INFO L482 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 288 flow [2021-08-13 03:15:27,194 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-08-13 03:15:27,194 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 03:15:27,194 INFO L266 CegarLoopForPetriNet]: 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, 1, 1, 1, 1] [2021-08-13 03:15:27,194 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 03:15:27,194 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err3INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-08-13 03:15:27,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 03:15:27,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1481937995, now seen corresponding path program 1 times [2021-08-13 03:15:27,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 03:15:27,195 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103503928] [2021-08-13 03:15:27,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 03:15:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 03:15:27,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 03:15:27,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 03:15:27,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 03:15:27,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-08-13 03:15:27,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 03:15:27,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 03:15:27,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 03:15:27,230 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 03:15:27,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103503928] [2021-08-13 03:15:27,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103503928] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 03:15:27,231 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 03:15:27,231 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-13 03:15:27,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933082736] [2021-08-13 03:15:27,232 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 03:15:27,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 03:15:27,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 03:15:27,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 03:15:27,233 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 77 [2021-08-13 03:15:27,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-08-13 03:15:27,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 03:15:27,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 77 [2021-08-13 03:15:27,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 03:15:27,908 INFO L129 PetriNetUnfolder]: 4279/8092 cut-off events. [2021-08-13 03:15:27,909 INFO L130 PetriNetUnfolder]: For 329/329 co-relation queries the response was YES. [2021-08-13 03:15:27,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15667 conditions, 8092 events. 4279/8092 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 64355 event pairs, 2595 based on Foata normal form. 140/7486 useless extension candidates. Maximal degree in co-relation 15636. Up to 4918 conditions per place. [2021-08-13 03:15:28,000 INFO L132 encePairwiseOnDemand]: 72/77 looper letters, 3 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2021-08-13 03:15:28,000 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 306 flow [2021-08-13 03:15:28,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 03:15:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 03:15:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2021-08-13 03:15:28,002 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9567099567099567 [2021-08-13 03:15:28,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 221 transitions. [2021-08-13 03:15:28,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 221 transitions. [2021-08-13 03:15:28,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 03:15:28,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 221 transitions. [2021-08-13 03:15:28,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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-08-13 03:15:28,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-08-13 03:15:28,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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-08-13 03:15:28,010 INFO L348 CegarLoopForPetriNet]: 70 programPoint places, 10 predicate places. [2021-08-13 03:15:28,010 INFO L482 AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 306 flow [2021-08-13 03:15:28,011 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-08-13 03:15:28,011 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 03:15:28,011 INFO L266 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 03:15:28,011 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 03:15:28,011 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thread4Thread1of1ForFork3Err8INUSE_VIOLATION, thread4Thread1of1ForFork3Err9INUSE_VIOLATION, thread1Err3INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, thread1Thread1of1ForFork2Err1INUSE_VIOLATION, thread1Thread1of1ForFork2Err2INUSE_VIOLATION, thread4Err0INUSE_VIOLATION, thread4Err4INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-08-13 03:15:28,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 03:15:28,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1063334278, now seen corresponding path program 1 times [2021-08-13 03:15:28,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 03:15:28,013 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526721138] [2021-08-13 03:15:28,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 03:15:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 03:15:28,032 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 03:15:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 03:15:28,055 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 03:15:28,092 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 03:15:28,093 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 03:15:28,094 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 03:15:28,096 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 03:15:28,122 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 03:15:28 BasicIcfg [2021-08-13 03:15:28,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 03:15:28,123 INFO L168 Benchmark]: Toolchain (without parser) took 4788.48 ms. Allocated memory was 181.4 MB in the beginning and 956.3 MB in the end (delta: 774.9 MB). Free memory was 162.0 MB in the beginning and 635.8 MB in the end (delta: -473.8 MB). Peak memory consumption was 302.4 MB. Max. memory is 8.0 GB. [2021-08-13 03:15:28,124 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.30 ms. Allocated memory is still 181.4 MB. Free memory is still 163.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 03:15:28,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.51 ms. Allocated memory is still 181.4 MB. Free memory was 162.0 MB in the beginning and 160.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 03:15:28,125 INFO L168 Benchmark]: Boogie Preprocessor took 29.98 ms. Allocated memory is still 181.4 MB. Free memory was 160.5 MB in the beginning and 159.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-08-13 03:15:28,125 INFO L168 Benchmark]: RCFGBuilder took 384.67 ms. Allocated memory is still 181.4 MB. Free memory was 159.3 MB in the beginning and 143.9 MB in the end (delta: 15.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-08-13 03:15:28,126 INFO L168 Benchmark]: TraceAbstraction took 4342.91 ms. Allocated memory was 181.4 MB in the beginning and 956.3 MB in the end (delta: 774.9 MB). Free memory was 143.4 MB in the beginning and 635.8 MB in the end (delta: -492.3 MB). Peak memory consumption was 283.5 MB. Max. memory is 8.0 GB. [2021-08-13 03:15:28,128 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.30 ms. Allocated memory is still 181.4 MB. Free memory is still 163.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 25.51 ms. Allocated memory is still 181.4 MB. Free memory was 162.0 MB in the beginning and 160.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 29.98 ms. Allocated memory is still 181.4 MB. Free memory was 160.5 MB in the beginning and 159.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 384.67 ms. Allocated memory is still 181.4 MB. Free memory was 159.3 MB in the beginning and 143.9 MB in the end (delta: 15.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4342.91 ms. Allocated memory was 181.4 MB in the beginning and 956.3 MB in the end (delta: 774.9 MB). Free memory was 143.4 MB in the beginning and 635.8 MB in the end (delta: -492.3 MB). Peak memory consumption was 283.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 121]: assertion can be violated assertion can be violated We found a FailurePath: [L115] 0 assume x_0 == x_8 && y_1 == y_9; VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L116] FORK 0 fork 1 thread1(); VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L117] FORK 0 fork 4, 4, 4, 4 thread4(); VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L103] 2 f1_10 := false; [L104] 2 f2_11 := false; VAL [f1_10=false, f2_11=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L106] FORK 2 fork 5, 5, 5, 5, 5 thread5(); VAL [f1_10=false, f2_11=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L107] FORK 2 fork 6, 6, 6, 6, 6, 6 thread6(); VAL [f1_10=false, f2_11=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L108] JOIN 3 join 5, 5, 5, 5, 5; VAL [f1_10=false, f2_11=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L109] JOIN 4 join 6, 6, 6, 6, 6, 6; VAL [f1_10=false, f2_11=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L60] 1 f1_2 := false; [L61] 1 f2_3 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L63] FORK 1 fork 2, 2 thread2(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L64] FORK 1 fork 3, 3, 3 thread3(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L45] 6 temp_6 := y_1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_6=-1, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L30] 5 temp_4 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L31] 5 x_0 := temp_4 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L32] 5 f1_2 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L46] 6 y_1 := temp_6 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L47] 6 f2_3 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L33] 5 assume f2_3; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L48] 6 assume f1_2; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L34] 5 temp_5 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L49] 6 temp_7 := x_0; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=0, x_8=-1, y_1=0, y_9=-1] [L35] 5 y_1 := temp_5 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=0, x_8=-1, y_1=1, y_9=-1] [L50] 6 x_0 := temp_7 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L51] 6 f2_3 := false; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L36] 5 f1_2 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L37] 5 assume !f2_3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L65] JOIN 5 join 2, 2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L52] 6 assume !f1_2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L66] JOIN 6 join 3, 3, 3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L118] JOIN 1 join 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L119] JOIN 2 join 4, 4, 4, 4; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L120] 0 assume !(x_0 == x_8 && y_1 == y_9); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L121] 0 assert false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 13.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 4063.7ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3458.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 80.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 38 SDtfs, 4 SDslu, 0 SDs, 0 SdLazy, 33 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=5, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 23.0ms SsaConstructionTime, 105.4ms SatisfiabilityAnalysisTime, 190.5ms InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 4/4 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...