/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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-0612a5f-m [2022-09-20 20:41:43,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 20:41:43,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 20:41:43,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 20:41:43,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 20:41:43,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 20:41:43,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 20:41:43,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 20:41:43,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 20:41:43,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 20:41:43,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 20:41:43,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 20:41:43,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 20:41:43,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 20:41:43,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 20:41:43,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 20:41:43,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 20:41:43,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 20:41:43,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 20:41:43,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 20:41:43,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 20:41:43,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 20:41:43,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 20:41:43,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 20:41:43,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 20:41:43,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 20:41:43,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 20:41:43,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 20:41:43,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 20:41:43,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 20:41:43,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 20:41:43,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 20:41:43,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 20:41:43,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 20:41:43,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 20:41:43,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 20:41:43,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 20:41:43,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 20:41:43,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 20:41:43,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 20:41:43,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 20:41:43,571 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.epf [2022-09-20 20:41:43,585 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 20:41:43,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 20:41:43,586 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 20:41:43,586 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 20:41:43,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 20:41:43,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 20:41:43,586 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 20:41:43,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 20:41:43,587 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 20:41:43,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 20:41:43,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 20:41:43,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 20:41:43,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 20:41:43,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 20:41:43,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 20:41:43,587 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 20:41:43,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 20:41:43,588 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 20:41:43,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 20:41:43,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 20:41:43,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 20:41:43,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 20:41:43,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 20:41:43,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:41:43,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 20:41:43,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 20:41:43,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 20:41:43,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 20:41:43,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 20:41:43,589 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 20:41:43,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 20:41:43,589 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 [2022-09-20 20:41:43,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 20:41:43,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 20:41:43,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 20:41:43,762 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 20:41:43,763 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 20:41:43,764 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-09-20 20:41:43,804 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43adcf158/0f7fff463f8148d799c3188640b9c7ed/FLAGff8b10bf3 [2022-09-20 20:41:44,233 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 20:41:44,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-09-20 20:41:44,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43adcf158/0f7fff463f8148d799c3188640b9c7ed/FLAGff8b10bf3 [2022-09-20 20:41:44,264 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43adcf158/0f7fff463f8148d799c3188640b9c7ed [2022-09-20 20:41:44,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 20:41:44,267 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 20:41:44,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 20:41:44,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 20:41:44,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 20:41:44,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:41:44" (1/1) ... [2022-09-20 20:41:44,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ebaa140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:44, skipping insertion in model container [2022-09-20 20:41:44,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:41:44" (1/1) ... [2022-09-20 20:41:44,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 20:41:44,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 20:41:44,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-09-20 20:41:44,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:41:44,639 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 20:41:44,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-09-20 20:41:44,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:41:44,694 INFO L208 MainTranslator]: Completed translation [2022-09-20 20:41:44,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:44 WrapperNode [2022-09-20 20:41:44,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 20:41:44,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 20:41:44,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 20:41:44,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 20:41:44,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:44" (1/1) ... [2022-09-20 20:41:44,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:44" (1/1) ... [2022-09-20 20:41:44,740 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 258 [2022-09-20 20:41:44,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 20:41:44,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 20:41:44,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 20:41:44,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 20:41:44,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:44" (1/1) ... [2022-09-20 20:41:44,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:44" (1/1) ... [2022-09-20 20:41:44,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:44" (1/1) ... [2022-09-20 20:41:44,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:44" (1/1) ... [2022-09-20 20:41:44,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:44" (1/1) ... [2022-09-20 20:41:44,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:44" (1/1) ... [2022-09-20 20:41:44,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:44" (1/1) ... [2022-09-20 20:41:44,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 20:41:44,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 20:41:44,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 20:41:44,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 20:41:44,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:44" (1/1) ... [2022-09-20 20:41:44,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:41:44,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 20:41:44,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-20 20:41:44,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 20:41:44,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 20:41:44,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 20:41:44,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 20:41:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 20:41:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 20:41:44,826 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 20:41:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 20:41:44,826 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 20:41:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 20:41:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 20:41:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 20:41:44,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 20:41:44,839 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 20:41:44,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-20 20:41:44,946 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 20:41:44,947 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 20:41:45,330 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 20:41:45,532 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 20:41:45,532 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 20:41:45,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:41:45 BoogieIcfgContainer [2022-09-20 20:41:45,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 20:41:45,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 20:41:45,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 20:41:45,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 20:41:45,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 08:41:44" (1/3) ... [2022-09-20 20:41:45,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222284e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:41:45, skipping insertion in model container [2022-09-20 20:41:45,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:44" (2/3) ... [2022-09-20 20:41:45,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222284e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:41:45, skipping insertion in model container [2022-09-20 20:41:45,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:41:45" (3/3) ... [2022-09-20 20:41:45,540 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2022-09-20 20:41:45,567 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 20:41:45,567 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 20:41:45,567 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 20:41:45,640 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 20:41:45,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 196 flow [2022-09-20 20:41:45,718 INFO L130 PetriNetUnfolder]: 2/91 cut-off events. [2022-09-20 20:41:45,718 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:41:45,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-09-20 20:41:45,720 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 93 transitions, 196 flow [2022-09-20 20:41:45,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 91 transitions, 188 flow [2022-09-20 20:41:45,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 20:41:45,735 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2eb4dee6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 20:41:45,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-09-20 20:41:45,745 INFO L130 PetriNetUnfolder]: 0/55 cut-off events. [2022-09-20 20:41:45,745 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:41:45,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:45,746 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:45,746 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:45,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:45,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1568406000, now seen corresponding path program 1 times [2022-09-20 20:41:45,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:45,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435937358] [2022-09-20 20:41:45,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:45,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:46,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:46,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435937358] [2022-09-20 20:41:46,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435937358] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:46,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:46,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 20:41:46,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287908033] [2022-09-20 20:41:46,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:46,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 20:41:46,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:46,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 20:41:46,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 20:41:46,050 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 93 [2022-09-20 20:41:46,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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) [2022-09-20 20:41:46,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:46,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 93 [2022-09-20 20:41:46,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:46,154 INFO L130 PetriNetUnfolder]: 17/213 cut-off events. [2022-09-20 20:41:46,154 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 20:41:46,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 213 events. 17/213 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 682 event pairs, 7 based on Foata normal form. 8/209 useless extension candidates. Maximal degree in co-relation 215. Up to 27 conditions per place. [2022-09-20 20:41:46,159 INFO L137 encePairwiseOnDemand]: 88/93 looper letters, 9 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2022-09-20 20:41:46,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 90 transitions, 208 flow [2022-09-20 20:41:46,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 20:41:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 20:41:46,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2022-09-20 20:41:46,170 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9283154121863799 [2022-09-20 20:41:46,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 259 transitions. [2022-09-20 20:41:46,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 259 transitions. [2022-09-20 20:41:46,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:46,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 259 transitions. [2022-09-20 20:41:46,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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) [2022-09-20 20:41:46,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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) [2022-09-20 20:41:46,181 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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) [2022-09-20 20:41:46,182 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 188 flow. Second operand 3 states and 259 transitions. [2022-09-20 20:41:46,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 90 transitions, 208 flow [2022-09-20 20:41:46,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 20:41:46,187 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 182 flow [2022-09-20 20:41:46,188 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2022-09-20 20:41:46,191 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, -2 predicate places. [2022-09-20 20:41:46,191 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 182 flow [2022-09-20 20:41:46,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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) [2022-09-20 20:41:46,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:46,192 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:46,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 20:41:46,192 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:46,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:46,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1291529996, now seen corresponding path program 1 times [2022-09-20 20:41:46,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:46,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324010418] [2022-09-20 20:41:46,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:46,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:46,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:46,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324010418] [2022-09-20 20:41:46,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324010418] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:46,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:46,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:41:46,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243389729] [2022-09-20 20:41:46,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:46,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:41:46,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:46,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:41:46,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:41:46,379 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2022-09-20 20:41:46,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 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) [2022-09-20 20:41:46,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:46,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2022-09-20 20:41:46,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:46,643 INFO L130 PetriNetUnfolder]: 178/649 cut-off events. [2022-09-20 20:41:46,643 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-09-20 20:41:46,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 649 events. 178/649 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3788 event pairs, 61 based on Foata normal form. 0/627 useless extension candidates. Maximal degree in co-relation 974. Up to 186 conditions per place. [2022-09-20 20:41:46,646 INFO L137 encePairwiseOnDemand]: 86/93 looper letters, 17 selfloop transitions, 3 changer transitions 43/125 dead transitions. [2022-09-20 20:41:46,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 125 transitions, 382 flow [2022-09-20 20:41:46,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:41:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:41:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 713 transitions. [2022-09-20 20:41:46,649 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2022-09-20 20:41:46,649 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 713 transitions. [2022-09-20 20:41:46,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 713 transitions. [2022-09-20 20:41:46,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:46,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 713 transitions. [2022-09-20 20:41:46,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.22222222222223) internal successors, (713), 9 states have internal predecessors, (713), 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) [2022-09-20 20:41:46,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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) [2022-09-20 20:41:46,654 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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) [2022-09-20 20:41:46,654 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 182 flow. Second operand 9 states and 713 transitions. [2022-09-20 20:41:46,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 125 transitions, 382 flow [2022-09-20 20:41:46,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 125 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 20:41:46,656 INFO L231 Difference]: Finished difference. Result has 107 places, 79 transitions, 201 flow [2022-09-20 20:41:46,656 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=201, PETRI_PLACES=107, PETRI_TRANSITIONS=79} [2022-09-20 20:41:46,656 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 11 predicate places. [2022-09-20 20:41:46,657 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 79 transitions, 201 flow [2022-09-20 20:41:46,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 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) [2022-09-20 20:41:46,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:46,657 INFO L208 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, 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] [2022-09-20 20:41:46,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 20:41:46,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:46,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:46,658 INFO L85 PathProgramCache]: Analyzing trace with hash -970249819, now seen corresponding path program 1 times [2022-09-20 20:41:46,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:46,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886165352] [2022-09-20 20:41:46,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:46,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:46,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:46,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886165352] [2022-09-20 20:41:46,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886165352] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:46,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:46,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 20:41:46,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790338442] [2022-09-20 20:41:46,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:46,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 20:41:46,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:46,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 20:41:46,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-09-20 20:41:46,839 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 93 [2022-09-20 20:41:46,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 79 transitions, 201 flow. Second operand has 9 states, 9 states have (on average 72.44444444444444) internal successors, (652), 9 states have internal predecessors, (652), 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) [2022-09-20 20:41:46,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:46,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 93 [2022-09-20 20:41:46,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:47,102 INFO L130 PetriNetUnfolder]: 159/430 cut-off events. [2022-09-20 20:41:47,102 INFO L131 PetriNetUnfolder]: For 362/362 co-relation queries the response was YES. [2022-09-20 20:41:47,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 430 events. 159/430 cut-off events. For 362/362 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1869 event pairs, 64 based on Foata normal form. 12/428 useless extension candidates. Maximal degree in co-relation 958. Up to 170 conditions per place. [2022-09-20 20:41:47,105 INFO L137 encePairwiseOnDemand]: 81/93 looper letters, 15 selfloop transitions, 10 changer transitions 34/121 dead transitions. [2022-09-20 20:41:47,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 121 transitions, 433 flow [2022-09-20 20:41:47,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-20 20:41:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-09-20 20:41:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1127 transitions. [2022-09-20 20:41:47,108 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8078853046594983 [2022-09-20 20:41:47,108 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1127 transitions. [2022-09-20 20:41:47,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1127 transitions. [2022-09-20 20:41:47,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:47,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1127 transitions. [2022-09-20 20:41:47,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 75.13333333333334) internal successors, (1127), 15 states have internal predecessors, (1127), 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) [2022-09-20 20:41:47,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 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) [2022-09-20 20:41:47,113 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 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) [2022-09-20 20:41:47,113 INFO L175 Difference]: Start difference. First operand has 107 places, 79 transitions, 201 flow. Second operand 15 states and 1127 transitions. [2022-09-20 20:41:47,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 121 transitions, 433 flow [2022-09-20 20:41:47,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 121 transitions, 412 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-09-20 20:41:47,118 INFO L231 Difference]: Finished difference. Result has 112 places, 85 transitions, 278 flow [2022-09-20 20:41:47,118 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=278, PETRI_PLACES=112, PETRI_TRANSITIONS=85} [2022-09-20 20:41:47,119 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 16 predicate places. [2022-09-20 20:41:47,119 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 85 transitions, 278 flow [2022-09-20 20:41:47,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.44444444444444) internal successors, (652), 9 states have internal predecessors, (652), 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) [2022-09-20 20:41:47,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:47,120 INFO L208 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, 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] [2022-09-20 20:41:47,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 20:41:47,120 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:47,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:47,120 INFO L85 PathProgramCache]: Analyzing trace with hash 516845962, now seen corresponding path program 1 times [2022-09-20 20:41:47,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:47,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624798677] [2022-09-20 20:41:47,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:47,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:47,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:47,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624798677] [2022-09-20 20:41:47,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624798677] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:47,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:47,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 20:41:47,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502969204] [2022-09-20 20:41:47,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:47,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 20:41:47,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:47,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 20:41:47,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-09-20 20:41:47,285 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 93 [2022-09-20 20:41:47,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 85 transitions, 278 flow. Second operand has 10 states, 10 states have (on average 72.4) internal successors, (724), 10 states have internal predecessors, (724), 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) [2022-09-20 20:41:47,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:47,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 93 [2022-09-20 20:41:47,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:47,635 INFO L130 PetriNetUnfolder]: 124/384 cut-off events. [2022-09-20 20:41:47,636 INFO L131 PetriNetUnfolder]: For 1129/1153 co-relation queries the response was YES. [2022-09-20 20:41:47,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 384 events. 124/384 cut-off events. For 1129/1153 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1652 event pairs, 28 based on Foata normal form. 9/376 useless extension candidates. Maximal degree in co-relation 1207. Up to 136 conditions per place. [2022-09-20 20:41:47,639 INFO L137 encePairwiseOnDemand]: 83/93 looper letters, 25 selfloop transitions, 8 changer transitions 25/120 dead transitions. [2022-09-20 20:41:47,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 120 transitions, 634 flow [2022-09-20 20:41:47,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-20 20:41:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-09-20 20:41:47,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1121 transitions. [2022-09-20 20:41:47,642 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.803584229390681 [2022-09-20 20:41:47,642 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1121 transitions. [2022-09-20 20:41:47,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1121 transitions. [2022-09-20 20:41:47,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:47,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1121 transitions. [2022-09-20 20:41:47,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 74.73333333333333) internal successors, (1121), 15 states have internal predecessors, (1121), 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) [2022-09-20 20:41:47,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 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) [2022-09-20 20:41:47,646 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 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) [2022-09-20 20:41:47,646 INFO L175 Difference]: Start difference. First operand has 112 places, 85 transitions, 278 flow. Second operand 15 states and 1121 transitions. [2022-09-20 20:41:47,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 120 transitions, 634 flow [2022-09-20 20:41:47,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 120 transitions, 606 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-09-20 20:41:47,654 INFO L231 Difference]: Finished difference. Result has 122 places, 87 transitions, 327 flow [2022-09-20 20:41:47,654 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=327, PETRI_PLACES=122, PETRI_TRANSITIONS=87} [2022-09-20 20:41:47,655 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 26 predicate places. [2022-09-20 20:41:47,655 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 87 transitions, 327 flow [2022-09-20 20:41:47,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 72.4) internal successors, (724), 10 states have internal predecessors, (724), 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) [2022-09-20 20:41:47,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:47,656 INFO L208 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, 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] [2022-09-20 20:41:47,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 20:41:47,658 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:47,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:47,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2018359713, now seen corresponding path program 1 times [2022-09-20 20:41:47,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:47,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494941] [2022-09-20 20:41:47,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:47,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:47,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:47,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494941] [2022-09-20 20:41:47,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494941] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:47,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:47,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:41:47,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112819152] [2022-09-20 20:41:47,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:47,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:41:47,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:47,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:41:47,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:41:47,822 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2022-09-20 20:41:47,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 87 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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) [2022-09-20 20:41:47,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:47,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2022-09-20 20:41:47,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:48,015 INFO L130 PetriNetUnfolder]: 164/531 cut-off events. [2022-09-20 20:41:48,015 INFO L131 PetriNetUnfolder]: For 2797/2918 co-relation queries the response was YES. [2022-09-20 20:41:48,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 531 events. 164/531 cut-off events. For 2797/2918 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2874 event pairs, 33 based on Foata normal form. 12/523 useless extension candidates. Maximal degree in co-relation 2102. Up to 145 conditions per place. [2022-09-20 20:41:48,019 INFO L137 encePairwiseOnDemand]: 87/93 looper letters, 33 selfloop transitions, 7 changer transitions 15/119 dead transitions. [2022-09-20 20:41:48,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 742 flow [2022-09-20 20:41:48,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:41:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:41:48,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 704 transitions. [2022-09-20 20:41:48,021 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8410991636798089 [2022-09-20 20:41:48,022 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 704 transitions. [2022-09-20 20:41:48,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 704 transitions. [2022-09-20 20:41:48,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:48,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 704 transitions. [2022-09-20 20:41:48,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 78.22222222222223) internal successors, (704), 9 states have internal predecessors, (704), 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) [2022-09-20 20:41:48,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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) [2022-09-20 20:41:48,025 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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) [2022-09-20 20:41:48,025 INFO L175 Difference]: Start difference. First operand has 122 places, 87 transitions, 327 flow. Second operand 9 states and 704 transitions. [2022-09-20 20:41:48,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 742 flow [2022-09-20 20:41:48,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 119 transitions, 678 flow, removed 28 selfloop flow, removed 9 redundant places. [2022-09-20 20:41:48,030 INFO L231 Difference]: Finished difference. Result has 119 places, 91 transitions, 375 flow [2022-09-20 20:41:48,031 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=375, PETRI_PLACES=119, PETRI_TRANSITIONS=91} [2022-09-20 20:41:48,031 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 23 predicate places. [2022-09-20 20:41:48,031 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 91 transitions, 375 flow [2022-09-20 20:41:48,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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) [2022-09-20 20:41:48,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:48,032 INFO L208 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, 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] [2022-09-20 20:41:48,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 20:41:48,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:48,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:48,032 INFO L85 PathProgramCache]: Analyzing trace with hash -71306102, now seen corresponding path program 1 times [2022-09-20 20:41:48,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:48,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936307023] [2022-09-20 20:41:48,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:48,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:48,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:48,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936307023] [2022-09-20 20:41:48,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936307023] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:48,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:48,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-20 20:41:48,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127754832] [2022-09-20 20:41:48,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:48,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-20 20:41:48,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:48,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-20 20:41:48,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-09-20 20:41:48,224 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2022-09-20 20:41:48,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 91 transitions, 375 flow. Second operand has 12 states, 12 states have (on average 71.33333333333333) internal successors, (856), 12 states have internal predecessors, (856), 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) [2022-09-20 20:41:48,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:48,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2022-09-20 20:41:48,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:48,674 INFO L130 PetriNetUnfolder]: 226/669 cut-off events. [2022-09-20 20:41:48,674 INFO L131 PetriNetUnfolder]: For 4323/4479 co-relation queries the response was YES. [2022-09-20 20:41:48,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2943 conditions, 669 events. 226/669 cut-off events. For 4323/4479 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3951 event pairs, 29 based on Foata normal form. 17/655 useless extension candidates. Maximal degree in co-relation 2864. Up to 222 conditions per place. [2022-09-20 20:41:48,679 INFO L137 encePairwiseOnDemand]: 81/93 looper letters, 23 selfloop transitions, 11 changer transitions 39/134 dead transitions. [2022-09-20 20:41:48,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 134 transitions, 966 flow [2022-09-20 20:41:48,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-09-20 20:41:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-09-20 20:41:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1250 transitions. [2022-09-20 20:41:48,682 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7906388361796332 [2022-09-20 20:41:48,682 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1250 transitions. [2022-09-20 20:41:48,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1250 transitions. [2022-09-20 20:41:48,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:48,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1250 transitions. [2022-09-20 20:41:48,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 73.52941176470588) internal successors, (1250), 17 states have internal predecessors, (1250), 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) [2022-09-20 20:41:48,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 93.0) internal successors, (1674), 18 states have internal predecessors, (1674), 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) [2022-09-20 20:41:48,687 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 93.0) internal successors, (1674), 18 states have internal predecessors, (1674), 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) [2022-09-20 20:41:48,687 INFO L175 Difference]: Start difference. First operand has 119 places, 91 transitions, 375 flow. Second operand 17 states and 1250 transitions. [2022-09-20 20:41:48,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 134 transitions, 966 flow [2022-09-20 20:41:48,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 134 transitions, 887 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-09-20 20:41:48,695 INFO L231 Difference]: Finished difference. Result has 139 places, 87 transitions, 382 flow [2022-09-20 20:41:48,696 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=382, PETRI_PLACES=139, PETRI_TRANSITIONS=87} [2022-09-20 20:41:48,696 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 43 predicate places. [2022-09-20 20:41:48,696 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 87 transitions, 382 flow [2022-09-20 20:41:48,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 71.33333333333333) internal successors, (856), 12 states have internal predecessors, (856), 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) [2022-09-20 20:41:48,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:48,697 INFO L208 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, 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] [2022-09-20 20:41:48,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 20:41:48,697 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:48,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:48,698 INFO L85 PathProgramCache]: Analyzing trace with hash 350751373, now seen corresponding path program 1 times [2022-09-20 20:41:48,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:48,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684703422] [2022-09-20 20:41:48,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:48,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:48,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:48,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684703422] [2022-09-20 20:41:48,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684703422] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:48,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:48,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 20:41:48,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640398972] [2022-09-20 20:41:48,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:48,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 20:41:48,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:48,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 20:41:48,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-09-20 20:41:48,842 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 93 [2022-09-20 20:41:48,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 87 transitions, 382 flow. Second operand has 11 states, 11 states have (on average 70.45454545454545) internal successors, (775), 11 states have internal predecessors, (775), 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) [2022-09-20 20:41:48,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:48,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 93 [2022-09-20 20:41:48,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:49,074 INFO L130 PetriNetUnfolder]: 114/406 cut-off events. [2022-09-20 20:41:49,074 INFO L131 PetriNetUnfolder]: For 4489/4620 co-relation queries the response was YES. [2022-09-20 20:41:49,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 406 events. 114/406 cut-off events. For 4489/4620 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2069 event pairs, 22 based on Foata normal form. 26/407 useless extension candidates. Maximal degree in co-relation 1968. Up to 118 conditions per place. [2022-09-20 20:41:49,077 INFO L137 encePairwiseOnDemand]: 80/93 looper letters, 18 selfloop transitions, 12 changer transitions 29/119 dead transitions. [2022-09-20 20:41:49,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 119 transitions, 907 flow [2022-09-20 20:41:49,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-20 20:41:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-09-20 20:41:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1085 transitions. [2022-09-20 20:41:49,079 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2022-09-20 20:41:49,079 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1085 transitions. [2022-09-20 20:41:49,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1085 transitions. [2022-09-20 20:41:49,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:49,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1085 transitions. [2022-09-20 20:41:49,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 72.33333333333333) internal successors, (1085), 15 states have internal predecessors, (1085), 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) [2022-09-20 20:41:49,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 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) [2022-09-20 20:41:49,084 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 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) [2022-09-20 20:41:49,084 INFO L175 Difference]: Start difference. First operand has 139 places, 87 transitions, 382 flow. Second operand 15 states and 1085 transitions. [2022-09-20 20:41:49,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 119 transitions, 907 flow [2022-09-20 20:41:49,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 119 transitions, 820 flow, removed 36 selfloop flow, removed 19 redundant places. [2022-09-20 20:41:49,090 INFO L231 Difference]: Finished difference. Result has 129 places, 88 transitions, 410 flow [2022-09-20 20:41:49,091 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=410, PETRI_PLACES=129, PETRI_TRANSITIONS=88} [2022-09-20 20:41:49,091 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 33 predicate places. [2022-09-20 20:41:49,091 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 88 transitions, 410 flow [2022-09-20 20:41:49,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 70.45454545454545) internal successors, (775), 11 states have internal predecessors, (775), 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) [2022-09-20 20:41:49,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:49,092 INFO L208 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, 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] [2022-09-20 20:41:49,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 20:41:49,092 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:49,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:49,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1258934546, now seen corresponding path program 1 times [2022-09-20 20:41:49,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:49,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220720173] [2022-09-20 20:41:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:49,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:49,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:49,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220720173] [2022-09-20 20:41:49,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220720173] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:49,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:49,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 20:41:49,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058046569] [2022-09-20 20:41:49,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:49,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 20:41:49,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:49,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 20:41:49,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-09-20 20:41:49,263 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2022-09-20 20:41:49,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 88 transitions, 410 flow. Second operand has 10 states, 10 states have (on average 71.7) internal successors, (717), 10 states have internal predecessors, (717), 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) [2022-09-20 20:41:49,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:49,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2022-09-20 20:41:49,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:49,511 INFO L130 PetriNetUnfolder]: 65/302 cut-off events. [2022-09-20 20:41:49,511 INFO L131 PetriNetUnfolder]: For 2881/2976 co-relation queries the response was YES. [2022-09-20 20:41:49,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1405 conditions, 302 events. 65/302 cut-off events. For 2881/2976 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1320 event pairs, 20 based on Foata normal form. 6/289 useless extension candidates. Maximal degree in co-relation 1318. Up to 111 conditions per place. [2022-09-20 20:41:49,513 INFO L137 encePairwiseOnDemand]: 82/93 looper letters, 26 selfloop transitions, 9 changer transitions 15/111 dead transitions. [2022-09-20 20:41:49,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 111 transitions, 800 flow [2022-09-20 20:41:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 20:41:49,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 20:41:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 882 transitions. [2022-09-20 20:41:49,516 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7903225806451613 [2022-09-20 20:41:49,516 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 882 transitions. [2022-09-20 20:41:49,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 882 transitions. [2022-09-20 20:41:49,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:49,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 882 transitions. [2022-09-20 20:41:49,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 73.5) internal successors, (882), 12 states have internal predecessors, (882), 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) [2022-09-20 20:41:49,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:49,520 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:49,520 INFO L175 Difference]: Start difference. First operand has 129 places, 88 transitions, 410 flow. Second operand 12 states and 882 transitions. [2022-09-20 20:41:49,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 111 transitions, 800 flow [2022-09-20 20:41:49,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 111 transitions, 747 flow, removed 17 selfloop flow, removed 10 redundant places. [2022-09-20 20:41:49,526 INFO L231 Difference]: Finished difference. Result has 132 places, 91 transitions, 456 flow [2022-09-20 20:41:49,526 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=456, PETRI_PLACES=132, PETRI_TRANSITIONS=91} [2022-09-20 20:41:49,527 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 36 predicate places. [2022-09-20 20:41:49,527 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 91 transitions, 456 flow [2022-09-20 20:41:49,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 71.7) internal successors, (717), 10 states have internal predecessors, (717), 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) [2022-09-20 20:41:49,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:49,528 INFO L208 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, 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] [2022-09-20 20:41:49,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 20:41:49,528 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:49,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash -589798524, now seen corresponding path program 2 times [2022-09-20 20:41:49,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:49,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667691959] [2022-09-20 20:41:49,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:49,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:49,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:49,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:49,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667691959] [2022-09-20 20:41:49,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667691959] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:49,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:49,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-09-20 20:41:49,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994757267] [2022-09-20 20:41:49,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:49,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-20 20:41:49,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:49,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-20 20:41:49,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-09-20 20:41:49,714 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 93 [2022-09-20 20:41:49,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 91 transitions, 456 flow. Second operand has 13 states, 13 states have (on average 70.38461538461539) internal successors, (915), 13 states have internal predecessors, (915), 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) [2022-09-20 20:41:49,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:49,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 93 [2022-09-20 20:41:49,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:49,972 INFO L130 PetriNetUnfolder]: 60/298 cut-off events. [2022-09-20 20:41:49,972 INFO L131 PetriNetUnfolder]: For 4219/4547 co-relation queries the response was YES. [2022-09-20 20:41:49,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 298 events. 60/298 cut-off events. For 4219/4547 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1326 event pairs, 18 based on Foata normal form. 7/286 useless extension candidates. Maximal degree in co-relation 1439. Up to 122 conditions per place. [2022-09-20 20:41:49,975 INFO L137 encePairwiseOnDemand]: 82/93 looper letters, 25 selfloop transitions, 5 changer transitions 17/107 dead transitions. [2022-09-20 20:41:49,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 107 transitions, 819 flow [2022-09-20 20:41:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 20:41:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 20:41:49,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1004 transitions. [2022-09-20 20:41:49,978 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7711213517665131 [2022-09-20 20:41:49,978 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1004 transitions. [2022-09-20 20:41:49,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1004 transitions. [2022-09-20 20:41:49,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:49,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1004 transitions. [2022-09-20 20:41:49,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 71.71428571428571) internal successors, (1004), 14 states have internal predecessors, (1004), 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) [2022-09-20 20:41:49,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 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) [2022-09-20 20:41:49,983 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 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) [2022-09-20 20:41:49,983 INFO L175 Difference]: Start difference. First operand has 132 places, 91 transitions, 456 flow. Second operand 14 states and 1004 transitions. [2022-09-20 20:41:49,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 107 transitions, 819 flow [2022-09-20 20:41:49,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 107 transitions, 725 flow, removed 41 selfloop flow, removed 10 redundant places. [2022-09-20 20:41:49,994 INFO L231 Difference]: Finished difference. Result has 135 places, 89 transitions, 434 flow [2022-09-20 20:41:49,994 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=434, PETRI_PLACES=135, PETRI_TRANSITIONS=89} [2022-09-20 20:41:49,995 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 39 predicate places. [2022-09-20 20:41:49,995 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 89 transitions, 434 flow [2022-09-20 20:41:49,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 70.38461538461539) internal successors, (915), 13 states have internal predecessors, (915), 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) [2022-09-20 20:41:49,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:49,996 INFO L208 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, 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] [2022-09-20 20:41:49,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 20:41:49,996 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:49,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:49,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1529296372, now seen corresponding path program 3 times [2022-09-20 20:41:49,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:49,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071996361] [2022-09-20 20:41:49,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:49,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:50,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:50,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071996361] [2022-09-20 20:41:50,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071996361] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:50,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:50,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 20:41:50,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236600961] [2022-09-20 20:41:50,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:50,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 20:41:50,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:50,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 20:41:50,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-09-20 20:41:50,224 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 93 [2022-09-20 20:41:50,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 89 transitions, 434 flow. Second operand has 11 states, 11 states have (on average 69.72727272727273) internal successors, (767), 11 states have internal predecessors, (767), 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) [2022-09-20 20:41:50,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:50,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 93 [2022-09-20 20:41:50,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:50,466 INFO L130 PetriNetUnfolder]: 45/261 cut-off events. [2022-09-20 20:41:50,466 INFO L131 PetriNetUnfolder]: For 3300/3576 co-relation queries the response was YES. [2022-09-20 20:41:50,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 261 events. 45/261 cut-off events. For 3300/3576 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1118 event pairs, 6 based on Foata normal form. 28/273 useless extension candidates. Maximal degree in co-relation 1172. Up to 51 conditions per place. [2022-09-20 20:41:50,468 INFO L137 encePairwiseOnDemand]: 83/93 looper letters, 26 selfloop transitions, 10 changer transitions 12/105 dead transitions. [2022-09-20 20:41:50,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 105 transitions, 776 flow [2022-09-20 20:41:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 20:41:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 20:41:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 924 transitions. [2022-09-20 20:41:50,470 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7642679900744417 [2022-09-20 20:41:50,470 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 924 transitions. [2022-09-20 20:41:50,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 924 transitions. [2022-09-20 20:41:50,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:50,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 924 transitions. [2022-09-20 20:41:50,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 71.07692307692308) internal successors, (924), 13 states have internal predecessors, (924), 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) [2022-09-20 20:41:50,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 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) [2022-09-20 20:41:50,478 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 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) [2022-09-20 20:41:50,478 INFO L175 Difference]: Start difference. First operand has 135 places, 89 transitions, 434 flow. Second operand 13 states and 924 transitions. [2022-09-20 20:41:50,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 105 transitions, 776 flow [2022-09-20 20:41:50,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 105 transitions, 648 flow, removed 58 selfloop flow, removed 14 redundant places. [2022-09-20 20:41:50,485 INFO L231 Difference]: Finished difference. Result has 131 places, 87 transitions, 406 flow [2022-09-20 20:41:50,486 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=406, PETRI_PLACES=131, PETRI_TRANSITIONS=87} [2022-09-20 20:41:50,487 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 35 predicate places. [2022-09-20 20:41:50,487 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 87 transitions, 406 flow [2022-09-20 20:41:50,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 69.72727272727273) internal successors, (767), 11 states have internal predecessors, (767), 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) [2022-09-20 20:41:50,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:50,487 INFO L208 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, 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] [2022-09-20 20:41:50,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 20:41:50,488 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:50,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:50,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1549834936, now seen corresponding path program 1 times [2022-09-20 20:41:50,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:50,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395548191] [2022-09-20 20:41:50,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:50,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:50,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:50,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395548191] [2022-09-20 20:41:50,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395548191] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:50,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:50,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:41:50,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349542346] [2022-09-20 20:41:50,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:50,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:41:50,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:50,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:41:50,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:41:50,576 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-09-20 20:41:50,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 87 transitions, 406 flow. Second operand has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 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) [2022-09-20 20:41:50,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:50,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-09-20 20:41:50,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:50,730 INFO L130 PetriNetUnfolder]: 164/562 cut-off events. [2022-09-20 20:41:50,731 INFO L131 PetriNetUnfolder]: For 3322/3360 co-relation queries the response was YES. [2022-09-20 20:41:50,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1854 conditions, 562 events. 164/562 cut-off events. For 3322/3360 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3182 event pairs, 12 based on Foata normal form. 38/587 useless extension candidates. Maximal degree in co-relation 1771. Up to 117 conditions per place. [2022-09-20 20:41:50,734 INFO L137 encePairwiseOnDemand]: 84/93 looper letters, 23 selfloop transitions, 5 changer transitions 44/133 dead transitions. [2022-09-20 20:41:50,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 133 transitions, 983 flow [2022-09-20 20:41:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:41:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:41:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 778 transitions. [2022-09-20 20:41:50,736 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8365591397849462 [2022-09-20 20:41:50,736 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 778 transitions. [2022-09-20 20:41:50,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 778 transitions. [2022-09-20 20:41:50,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:50,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 778 transitions. [2022-09-20 20:41:50,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 77.8) internal successors, (778), 10 states have internal predecessors, (778), 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) [2022-09-20 20:41:50,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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) [2022-09-20 20:41:50,740 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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) [2022-09-20 20:41:50,740 INFO L175 Difference]: Start difference. First operand has 131 places, 87 transitions, 406 flow. Second operand 10 states and 778 transitions. [2022-09-20 20:41:50,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 133 transitions, 983 flow [2022-09-20 20:41:50,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 133 transitions, 752 flow, removed 85 selfloop flow, removed 23 redundant places. [2022-09-20 20:41:50,745 INFO L231 Difference]: Finished difference. Result has 117 places, 82 transitions, 312 flow [2022-09-20 20:41:50,746 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=312, PETRI_PLACES=117, PETRI_TRANSITIONS=82} [2022-09-20 20:41:50,746 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 21 predicate places. [2022-09-20 20:41:50,746 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 82 transitions, 312 flow [2022-09-20 20:41:50,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 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) [2022-09-20 20:41:50,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:50,747 INFO L208 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, 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] [2022-09-20 20:41:50,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 20:41:50,747 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:50,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:50,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2006400155, now seen corresponding path program 1 times [2022-09-20 20:41:50,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:50,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135216210] [2022-09-20 20:41:50,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:50,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:50,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:50,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:50,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135216210] [2022-09-20 20:41:50,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135216210] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:50,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:50,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:41:50,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110065440] [2022-09-20 20:41:50,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:50,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:41:50,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:50,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:41:50,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:41:50,821 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-09-20 20:41:50,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 82 transitions, 312 flow. Second operand has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 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) [2022-09-20 20:41:50,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:50,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-09-20 20:41:50,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:50,957 INFO L130 PetriNetUnfolder]: 32/188 cut-off events. [2022-09-20 20:41:50,957 INFO L131 PetriNetUnfolder]: For 498/502 co-relation queries the response was YES. [2022-09-20 20:41:50,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 188 events. 32/188 cut-off events. For 498/502 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 586 event pairs, 0 based on Foata normal form. 13/201 useless extension candidates. Maximal degree in co-relation 525. Up to 39 conditions per place. [2022-09-20 20:41:50,958 INFO L137 encePairwiseOnDemand]: 85/93 looper letters, 15 selfloop transitions, 7 changer transitions 20/102 dead transitions. [2022-09-20 20:41:50,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 102 transitions, 561 flow [2022-09-20 20:41:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:41:50,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:41:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 757 transitions. [2022-09-20 20:41:50,960 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8139784946236559 [2022-09-20 20:41:50,960 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 757 transitions. [2022-09-20 20:41:50,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 757 transitions. [2022-09-20 20:41:50,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:50,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 757 transitions. [2022-09-20 20:41:50,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.7) internal successors, (757), 10 states have internal predecessors, (757), 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) [2022-09-20 20:41:50,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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) [2022-09-20 20:41:50,963 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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) [2022-09-20 20:41:50,963 INFO L175 Difference]: Start difference. First operand has 117 places, 82 transitions, 312 flow. Second operand 10 states and 757 transitions. [2022-09-20 20:41:50,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 102 transitions, 561 flow [2022-09-20 20:41:50,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 102 transitions, 412 flow, removed 62 selfloop flow, removed 16 redundant places. [2022-09-20 20:41:50,966 INFO L231 Difference]: Finished difference. Result has 110 places, 80 transitions, 252 flow [2022-09-20 20:41:50,966 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=252, PETRI_PLACES=110, PETRI_TRANSITIONS=80} [2022-09-20 20:41:50,968 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 14 predicate places. [2022-09-20 20:41:50,968 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 80 transitions, 252 flow [2022-09-20 20:41:50,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 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) [2022-09-20 20:41:50,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:50,968 INFO L208 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, 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] [2022-09-20 20:41:50,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-20 20:41:50,968 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-09-20 20:41:50,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:50,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1923868513, now seen corresponding path program 1 times [2022-09-20 20:41:50,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:50,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906421338] [2022-09-20 20:41:50,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:50,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:41:51,012 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-20 20:41:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:41:51,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-20 20:41:51,077 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-09-20 20:41:51,077 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-09-20 20:41:51,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-09-20 20:41:51,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-09-20 20:41:51,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-09-20 20:41:51,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-09-20 20:41:51,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-09-20 20:41:51,081 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:51,085 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 20:41:51,085 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 20:41:51,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 08:41:51 BasicIcfg [2022-09-20 20:41:51,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 20:41:51,178 INFO L158 Benchmark]: Toolchain (without parser) took 6910.38ms. Allocated memory was 212.9MB in the beginning and 439.4MB in the end (delta: 226.5MB). Free memory was 183.6MB in the beginning and 253.4MB in the end (delta: -69.8MB). Peak memory consumption was 157.0MB. Max. memory is 8.0GB. [2022-09-20 20:41:51,178 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 212.9MB. Free memory is still 172.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 20:41:51,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.75ms. Allocated memory is still 212.9MB. Free memory was 183.4MB in the beginning and 174.3MB in the end (delta: 9.1MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-09-20 20:41:51,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.13ms. Allocated memory is still 212.9MB. Free memory was 174.3MB in the beginning and 171.2MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-20 20:41:51,179 INFO L158 Benchmark]: Boogie Preprocessor took 19.84ms. Allocated memory is still 212.9MB. Free memory was 171.2MB in the beginning and 169.4MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-20 20:41:51,179 INFO L158 Benchmark]: RCFGBuilder took 772.42ms. Allocated memory was 212.9MB in the beginning and 293.6MB in the end (delta: 80.7MB). Free memory was 169.1MB in the beginning and 235.0MB in the end (delta: -65.8MB). Peak memory consumption was 44.5MB. Max. memory is 8.0GB. [2022-09-20 20:41:51,179 INFO L158 Benchmark]: TraceAbstraction took 5642.10ms. Allocated memory was 293.6MB in the beginning and 439.4MB in the end (delta: 145.8MB). Free memory was 234.5MB in the beginning and 253.4MB in the end (delta: -18.9MB). Peak memory consumption was 126.9MB. Max. memory is 8.0GB. [2022-09-20 20:41:51,180 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 212.9MB. Free memory is still 172.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 426.75ms. Allocated memory is still 212.9MB. Free memory was 183.4MB in the beginning and 174.3MB in the end (delta: 9.1MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.13ms. Allocated memory is still 212.9MB. Free memory was 174.3MB in the beginning and 171.2MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.84ms. Allocated memory is still 212.9MB. Free memory was 171.2MB in the beginning and 169.4MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 772.42ms. Allocated memory was 212.9MB in the beginning and 293.6MB in the end (delta: 80.7MB). Free memory was 169.1MB in the beginning and 235.0MB in the end (delta: -65.8MB). Peak memory consumption was 44.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5642.10ms. Allocated memory was 293.6MB in the beginning and 439.4MB in the end (delta: 145.8MB). Free memory was 234.5MB in the beginning and 253.4MB in the end (delta: -18.9MB). Peak memory consumption was 126.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L713] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L714] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L715] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L716] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L717] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L718] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L719] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L720] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L721] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L722] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L723] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L724] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L725] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L726] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] 0 pthread_t t2475; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475, ((void *)0), P0, ((void *)0))=-1, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2476; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476, ((void *)0), P1, ((void *)0))=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 111 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 462 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 462 mSDsluCounter, 554 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 693 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1194 IncrementalHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 110 mSDtfsCounter, 1194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=456occurred in iteration=8, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 848 NumberOfCodeBlocks, 848 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 764 ConstructedInterpolants, 0 QuantifiedInterpolants, 4627 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-09-20 20:41:51,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...