./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 08:44:47,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 08:44:47,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 08:44:47,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 08:44:47,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 08:44:47,560 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 08:44:47,561 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 08:44:47,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 08:44:47,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 08:44:47,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 08:44:47,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 08:44:47,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 08:44:47,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 08:44:47,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 08:44:47,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 08:44:47,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 08:44:47,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 08:44:47,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 08:44:47,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 08:44:47,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 08:44:47,574 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 08:44:47,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 08:44:47,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 08:44:47,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 08:44:47,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 08:44:47,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 08:44:47,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 08:44:47,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 08:44:47,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 08:44:47,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 08:44:47,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 08:44:47,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 08:44:47,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 08:44:47,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 08:44:47,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 08:44:47,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 08:44:47,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 08:44:47,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 08:44:47,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 08:44:47,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 08:44:47,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 08:44:47,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 08:44:47,590 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 08:44:47,616 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 08:44:47,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 08:44:47,618 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 08:44:47,618 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 08:44:47,619 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 08:44:47,619 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 08:44:47,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 08:44:47,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 08:44:47,620 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 08:44:47,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 08:44:47,621 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 08:44:47,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 08:44:47,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 08:44:47,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 08:44:47,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 08:44:47,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 08:44:47,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 08:44:47,628 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 08:44:47,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 08:44:47,629 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 08:44:47,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 08:44:47,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 08:44:47,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 08:44:47,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 08:44:47,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:44:47,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 08:44:47,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 08:44:47,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 08:44:47,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 08:44:47,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 08:44:47,631 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 08:44:47,631 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 08:44:47,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 08:44:47,631 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2022-07-21 08:44:47,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 08:44:47,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 08:44:47,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 08:44:47,933 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 08:44:47,933 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 08:44:47,934 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-07-21 08:44:47,985 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/698e1ecf8/beb834c659ea43119e15418365d666b9/FLAG1a0a7464d [2022-07-21 08:44:48,488 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 08:44:48,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-07-21 08:44:48,512 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/698e1ecf8/beb834c659ea43119e15418365d666b9/FLAG1a0a7464d [2022-07-21 08:44:48,819 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/698e1ecf8/beb834c659ea43119e15418365d666b9 [2022-07-21 08:44:48,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 08:44:48,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 08:44:48,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 08:44:48,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 08:44:48,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 08:44:48,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:44:48" (1/1) ... [2022-07-21 08:44:48,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e50a0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:44:48, skipping insertion in model container [2022-07-21 08:44:48,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:44:48" (1/1) ... [2022-07-21 08:44:48,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 08:44:48,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 08:44:48,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-07-21 08:44:49,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:44:49,108 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 08:44:49,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-07-21 08:44:49,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:44:49,174 INFO L208 MainTranslator]: Completed translation [2022-07-21 08:44:49,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:44:49 WrapperNode [2022-07-21 08:44:49,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 08:44:49,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 08:44:49,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 08:44:49,176 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 08:44:49,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:44:49" (1/1) ... [2022-07-21 08:44:49,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:44:49" (1/1) ... [2022-07-21 08:44:49,217 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 273 [2022-07-21 08:44:49,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 08:44:49,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 08:44:49,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 08:44:49,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 08:44:49,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:44:49" (1/1) ... [2022-07-21 08:44:49,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:44:49" (1/1) ... [2022-07-21 08:44:49,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:44:49" (1/1) ... [2022-07-21 08:44:49,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:44:49" (1/1) ... [2022-07-21 08:44:49,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:44:49" (1/1) ... [2022-07-21 08:44:49,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:44:49" (1/1) ... [2022-07-21 08:44:49,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:44:49" (1/1) ... [2022-07-21 08:44:49,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 08:44:49,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 08:44:49,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 08:44:49,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 08:44:49,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:44:49" (1/1) ... [2022-07-21 08:44:49,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:44:49,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:44:49,264 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-07-21 08:44:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 08:44:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-21 08:44:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 08:44:49,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 08:44:49,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 08:44:49,313 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-21 08:44:49,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-21 08:44:49,313 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-21 08:44:49,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-21 08:44:49,313 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-21 08:44:49,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-21 08:44:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 08:44:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-21 08:44:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 08:44:49,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 08:44:49,300 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-07-21 08:44:49,316 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-21 08:44:49,426 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 08:44:49,427 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 08:44:49,790 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 08:44:49,975 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 08:44:49,975 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 08:44:49,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:44:49 BoogieIcfgContainer [2022-07-21 08:44:49,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 08:44:49,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 08:44:49,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 08:44:49,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 08:44:49,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:44:48" (1/3) ... [2022-07-21 08:44:49,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55655b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:44:49, skipping insertion in model container [2022-07-21 08:44:49,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:44:49" (2/3) ... [2022-07-21 08:44:49,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55655b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:44:49, skipping insertion in model container [2022-07-21 08:44:49,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:44:49" (3/3) ... [2022-07-21 08:44:49,986 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-07-21 08:44:49,990 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-21 08:44:49,997 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 08:44:49,997 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 08:44:49,997 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-21 08:44:50,038 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-21 08:44:50,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-07-21 08:44:50,097 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2022-07-21 08:44:50,098 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:44:50,101 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-07-21 08:44:50,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-07-21 08:44:50,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-07-21 08:44:50,111 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:44:50,115 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=true, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5abe8e24, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f815b24 [2022-07-21 08:44:50,116 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-21 08:44:50,124 INFO L129 PetriNetUnfolder]: 0/45 cut-off events. [2022-07-21 08:44:50,124 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:44:50,124 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:44:50,125 INFO L200 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] [2022-07-21 08:44:50,125 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:44:50,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:44:50,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1982469961, now seen corresponding path program 1 times [2022-07-21 08:44:50,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:44:50,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813415555] [2022-07-21 08:44:50,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:44:50,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:44:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:44:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:44:50,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:44:50,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813415555] [2022-07-21 08:44:50,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813415555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:44:50,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:44:50,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 08:44:50,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814923580] [2022-07-21 08:44:50,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:44:50,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:44:50,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:44:50,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:44:50,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 08:44:50,447 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 113 [2022-07-21 08:44:50,451 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-07-21 08:44:50,451 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:44:50,451 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 113 [2022-07-21 08:44:50,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:44:50,620 INFO L129 PetriNetUnfolder]: 58/486 cut-off events. [2022-07-21 08:44:50,621 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-07-21 08:44:50,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 486 events. 58/486 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2507 event pairs, 44 based on Foata normal form. 15/471 useless extension candidates. Maximal degree in co-relation 565. Up to 79 conditions per place. [2022-07-21 08:44:50,627 INFO L132 encePairwiseOnDemand]: 108/113 looper letters, 14 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-07-21 08:44:50,627 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 112 transitions, 271 flow [2022-07-21 08:44:50,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:44:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 08:44:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2022-07-21 08:44:50,641 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9380530973451328 [2022-07-21 08:44:50,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2022-07-21 08:44:50,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2022-07-21 08:44:50,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:44:50,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2022-07-21 08:44:50,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-07-21 08:44:50,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-07-21 08:44:50,657 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-07-21 08:44:50,659 INFO L186 Difference]: Start difference. First operand has 118 places, 110 transitions, 229 flow. Second operand 3 states and 318 transitions. [2022-07-21 08:44:50,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 112 transitions, 271 flow [2022-07-21 08:44:50,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-21 08:44:50,664 INFO L242 Difference]: Finished difference. Result has 115 places, 106 transitions, 222 flow [2022-07-21 08:44:50,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2022-07-21 08:44:50,669 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2022-07-21 08:44:50,669 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 222 flow [2022-07-21 08:44:50,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-07-21 08:44:50,670 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:44:50,670 INFO L200 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-07-21 08:44:50,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 08:44:50,670 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:44:50,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:44:50,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2004174537, now seen corresponding path program 1 times [2022-07-21 08:44:50,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:44:50,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013493810] [2022-07-21 08:44:50,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:44:50,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:44:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:44:50,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:44:50,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:44:50,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013493810] [2022-07-21 08:44:50,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013493810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:44:50,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:44:50,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 08:44:50,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436177517] [2022-07-21 08:44:50,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:44:50,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 08:44:50,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:44:50,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 08:44:50,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:44:50,967 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-21 08:44:50,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 222 flow. Second operand has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 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-07-21 08:44:50,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:44:50,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-21 08:44:50,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:44:51,416 INFO L129 PetriNetUnfolder]: 369/1236 cut-off events. [2022-07-21 08:44:51,416 INFO L130 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-07-21 08:44:51,419 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1940 conditions, 1236 events. 369/1236 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8538 event pairs, 100 based on Foata normal form. 0/1202 useless extension candidates. Maximal degree in co-relation 1887. Up to 352 conditions per place. [2022-07-21 08:44:51,421 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 21 selfloop transitions, 10 changer transitions 59/165 dead transitions. [2022-07-21 08:44:51,421 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 165 transitions, 520 flow [2022-07-21 08:44:51,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 08:44:51,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-21 08:44:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1417 transitions. [2022-07-21 08:44:51,425 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8359882005899705 [2022-07-21 08:44:51,425 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1417 transitions. [2022-07-21 08:44:51,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1417 transitions. [2022-07-21 08:44:51,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:44:51,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1417 transitions. [2022-07-21 08:44:51,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 94.46666666666667) internal successors, (1417), 15 states have internal predecessors, (1417), 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-07-21 08:44:51,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 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-07-21 08:44:51,433 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 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-07-21 08:44:51,433 INFO L186 Difference]: Start difference. First operand has 115 places, 106 transitions, 222 flow. Second operand 15 states and 1417 transitions. [2022-07-21 08:44:51,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 165 transitions, 520 flow [2022-07-21 08:44:51,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 165 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-21 08:44:51,436 INFO L242 Difference]: Finished difference. Result has 138 places, 100 transitions, 278 flow [2022-07-21 08:44:51,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=278, PETRI_PLACES=138, PETRI_TRANSITIONS=100} [2022-07-21 08:44:51,437 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 20 predicate places. [2022-07-21 08:44:51,437 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 100 transitions, 278 flow [2022-07-21 08:44:51,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 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-07-21 08:44:51,438 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:44:51,438 INFO L200 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, 1, 1, 1] [2022-07-21 08:44:51,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 08:44:51,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:44:51,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:44:51,439 INFO L85 PathProgramCache]: Analyzing trace with hash -641825364, now seen corresponding path program 1 times [2022-07-21 08:44:51,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:44:51,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718339496] [2022-07-21 08:44:51,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:44:51,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:44:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:44:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:44:51,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:44:51,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718339496] [2022-07-21 08:44:51,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718339496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:44:51,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:44:51,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:44:51,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815790874] [2022-07-21 08:44:51,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:44:51,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:44:51,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:44:51,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:44:51,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:44:51,548 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-07-21 08:44:51,549 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 100 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-07-21 08:44:51,549 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:44:51,549 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-07-21 08:44:51,549 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:44:51,827 INFO L129 PetriNetUnfolder]: 513/1195 cut-off events. [2022-07-21 08:44:51,827 INFO L130 PetriNetUnfolder]: For 1808/1816 co-relation queries the response was YES. [2022-07-21 08:44:51,831 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3202 conditions, 1195 events. 513/1195 cut-off events. For 1808/1816 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7204 event pairs, 161 based on Foata normal form. 24/1166 useless extension candidates. Maximal degree in co-relation 3137. Up to 528 conditions per place. [2022-07-21 08:44:51,836 INFO L132 encePairwiseOnDemand]: 106/113 looper letters, 26 selfloop transitions, 3 changer transitions 37/145 dead transitions. [2022-07-21 08:44:51,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 145 transitions, 622 flow [2022-07-21 08:44:51,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:44:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:44:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 882 transitions. [2022-07-21 08:44:51,839 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8672566371681416 [2022-07-21 08:44:51,839 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 882 transitions. [2022-07-21 08:44:51,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 882 transitions. [2022-07-21 08:44:51,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:44:51,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 882 transitions. [2022-07-21 08:44:51,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.0) internal successors, (882), 9 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-07-21 08:44:51,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-07-21 08:44:51,843 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-07-21 08:44:51,843 INFO L186 Difference]: Start difference. First operand has 138 places, 100 transitions, 278 flow. Second operand 9 states and 882 transitions. [2022-07-21 08:44:51,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 145 transitions, 622 flow [2022-07-21 08:44:51,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 145 transitions, 604 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-07-21 08:44:51,851 INFO L242 Difference]: Finished difference. Result has 127 places, 102 transitions, 311 flow [2022-07-21 08:44:51,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=311, PETRI_PLACES=127, PETRI_TRANSITIONS=102} [2022-07-21 08:44:51,852 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 9 predicate places. [2022-07-21 08:44:51,852 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 102 transitions, 311 flow [2022-07-21 08:44:51,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-07-21 08:44:51,853 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:44:51,853 INFO L200 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, 1, 1, 1, 1] [2022-07-21 08:44:51,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 08:44:51,853 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:44:51,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:44:51,854 INFO L85 PathProgramCache]: Analyzing trace with hash -469615416, now seen corresponding path program 1 times [2022-07-21 08:44:51,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:44:51,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663218587] [2022-07-21 08:44:51,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:44:51,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:44:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:44:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:44:51,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:44:51,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663218587] [2022-07-21 08:44:51,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663218587] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:44:51,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:44:51,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:44:51,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085506646] [2022-07-21 08:44:51,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:44:51,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:44:51,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:44:51,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:44:51,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:44:51,964 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-07-21 08:44:51,965 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 102 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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-07-21 08:44:51,965 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:44:51,965 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-07-21 08:44:51,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:44:52,241 INFO L129 PetriNetUnfolder]: 537/1257 cut-off events. [2022-07-21 08:44:52,241 INFO L130 PetriNetUnfolder]: For 2844/2856 co-relation queries the response was YES. [2022-07-21 08:44:52,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3730 conditions, 1257 events. 537/1257 cut-off events. For 2844/2856 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7546 event pairs, 209 based on Foata normal form. 13/1189 useless extension candidates. Maximal degree in co-relation 3661. Up to 691 conditions per place. [2022-07-21 08:44:52,251 INFO L132 encePairwiseOnDemand]: 106/113 looper letters, 24 selfloop transitions, 3 changer transitions 25/133 dead transitions. [2022-07-21 08:44:52,251 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 133 transitions, 530 flow [2022-07-21 08:44:52,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:44:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:44:52,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 869 transitions. [2022-07-21 08:44:52,254 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8544739429695182 [2022-07-21 08:44:52,254 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 869 transitions. [2022-07-21 08:44:52,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 869 transitions. [2022-07-21 08:44:52,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:44:52,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 869 transitions. [2022-07-21 08:44:52,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.55555555555556) internal successors, (869), 9 states have internal predecessors, (869), 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-07-21 08:44:52,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-07-21 08:44:52,258 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-07-21 08:44:52,258 INFO L186 Difference]: Start difference. First operand has 127 places, 102 transitions, 311 flow. Second operand 9 states and 869 transitions. [2022-07-21 08:44:52,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 133 transitions, 530 flow [2022-07-21 08:44:52,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 133 transitions, 513 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-07-21 08:44:52,265 INFO L242 Difference]: Finished difference. Result has 132 places, 104 transitions, 345 flow [2022-07-21 08:44:52,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=345, PETRI_PLACES=132, PETRI_TRANSITIONS=104} [2022-07-21 08:44:52,266 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 14 predicate places. [2022-07-21 08:44:52,266 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 104 transitions, 345 flow [2022-07-21 08:44:52,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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-07-21 08:44:52,266 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:44:52,266 INFO L200 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, 1, 1, 1, 1] [2022-07-21 08:44:52,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 08:44:52,267 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:44:52,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:44:52,267 INFO L85 PathProgramCache]: Analyzing trace with hash 990989051, now seen corresponding path program 1 times [2022-07-21 08:44:52,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:44:52,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414995069] [2022-07-21 08:44:52,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:44:52,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:44:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:44:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:44:52,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:44:52,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414995069] [2022-07-21 08:44:52,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414995069] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:44:52,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:44:52,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:44:52,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044422224] [2022-07-21 08:44:52,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:44:52,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:44:52,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:44:52,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:44:52,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:44:52,365 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-07-21 08:44:52,366 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 104 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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-07-21 08:44:52,366 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:44:52,366 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-07-21 08:44:52,366 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:44:52,754 INFO L129 PetriNetUnfolder]: 829/1930 cut-off events. [2022-07-21 08:44:52,754 INFO L130 PetriNetUnfolder]: For 6940/6969 co-relation queries the response was YES. [2022-07-21 08:44:52,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6613 conditions, 1930 events. 829/1930 cut-off events. For 6940/6969 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13632 event pairs, 150 based on Foata normal form. 38/1878 useless extension candidates. Maximal degree in co-relation 6539. Up to 526 conditions per place. [2022-07-21 08:44:52,770 INFO L132 encePairwiseOnDemand]: 107/113 looper letters, 34 selfloop transitions, 3 changer transitions 34/152 dead transitions. [2022-07-21 08:44:52,771 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 152 transitions, 826 flow [2022-07-21 08:44:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:44:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:44:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 883 transitions. [2022-07-21 08:44:52,773 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8682399213372665 [2022-07-21 08:44:52,773 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 883 transitions. [2022-07-21 08:44:52,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 883 transitions. [2022-07-21 08:44:52,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:44:52,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 883 transitions. [2022-07-21 08:44:52,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.11111111111111) internal successors, (883), 9 states have internal predecessors, (883), 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-07-21 08:44:52,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-07-21 08:44:52,777 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-07-21 08:44:52,777 INFO L186 Difference]: Start difference. First operand has 132 places, 104 transitions, 345 flow. Second operand 9 states and 883 transitions. [2022-07-21 08:44:52,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 152 transitions, 826 flow [2022-07-21 08:44:52,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 152 transitions, 795 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-07-21 08:44:52,789 INFO L242 Difference]: Finished difference. Result has 137 places, 104 transitions, 357 flow [2022-07-21 08:44:52,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=357, PETRI_PLACES=137, PETRI_TRANSITIONS=104} [2022-07-21 08:44:52,790 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 19 predicate places. [2022-07-21 08:44:52,790 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 104 transitions, 357 flow [2022-07-21 08:44:52,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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-07-21 08:44:52,790 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:44:52,790 INFO L200 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, 1, 1, 1, 1, 1] [2022-07-21 08:44:52,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 08:44:52,791 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:44:52,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:44:52,791 INFO L85 PathProgramCache]: Analyzing trace with hash -937336573, now seen corresponding path program 1 times [2022-07-21 08:44:52,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:44:52,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584849831] [2022-07-21 08:44:52,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:44:52,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:44:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:44:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:44:52,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:44:52,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584849831] [2022-07-21 08:44:52,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584849831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:44:52,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:44:52,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 08:44:52,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447573621] [2022-07-21 08:44:52,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:44:52,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 08:44:52,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:44:52,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 08:44:52,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:44:52,939 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-21 08:44:52,940 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 104 transitions, 357 flow. Second operand has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 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-07-21 08:44:52,940 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:44:52,940 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-21 08:44:52,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:44:53,379 INFO L129 PetriNetUnfolder]: 718/1665 cut-off events. [2022-07-21 08:44:53,379 INFO L130 PetriNetUnfolder]: For 8380/8469 co-relation queries the response was YES. [2022-07-21 08:44:53,386 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6241 conditions, 1665 events. 718/1665 cut-off events. For 8380/8469 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11019 event pairs, 282 based on Foata normal form. 41/1599 useless extension candidates. Maximal degree in co-relation 6160. Up to 629 conditions per place. [2022-07-21 08:44:53,393 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 33 selfloop transitions, 11 changer transitions 25/148 dead transitions. [2022-07-21 08:44:53,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 148 transitions, 801 flow [2022-07-21 08:44:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 08:44:53,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-21 08:44:53,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1133 transitions. [2022-07-21 08:44:53,397 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8355457227138643 [2022-07-21 08:44:53,397 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1133 transitions. [2022-07-21 08:44:53,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1133 transitions. [2022-07-21 08:44:53,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:44:53,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1133 transitions. [2022-07-21 08:44:53,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 94.41666666666667) internal successors, (1133), 12 states have internal predecessors, (1133), 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-07-21 08:44:53,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 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-07-21 08:44:53,402 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 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-07-21 08:44:53,402 INFO L186 Difference]: Start difference. First operand has 137 places, 104 transitions, 357 flow. Second operand 12 states and 1133 transitions. [2022-07-21 08:44:53,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 148 transitions, 801 flow [2022-07-21 08:44:53,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 148 transitions, 740 flow, removed 29 selfloop flow, removed 7 redundant places. [2022-07-21 08:44:53,411 INFO L242 Difference]: Finished difference. Result has 143 places, 109 transitions, 416 flow [2022-07-21 08:44:53,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=416, PETRI_PLACES=143, PETRI_TRANSITIONS=109} [2022-07-21 08:44:53,412 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2022-07-21 08:44:53,412 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 109 transitions, 416 flow [2022-07-21 08:44:53,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 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-07-21 08:44:53,413 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:44:53,413 INFO L200 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, 1, 1, 1, 1, 1] [2022-07-21 08:44:53,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 08:44:53,413 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:44:53,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:44:53,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1634399701, now seen corresponding path program 2 times [2022-07-21 08:44:53,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:44:53,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111394297] [2022-07-21 08:44:53,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:44:53,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:44:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:44:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:44:53,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:44:53,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111394297] [2022-07-21 08:44:53,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111394297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:44:53,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:44:53,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 08:44:53,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487664662] [2022-07-21 08:44:53,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:44:53,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 08:44:53,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:44:53,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 08:44:53,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:44:53,570 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 113 [2022-07-21 08:44:53,571 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 109 transitions, 416 flow. Second operand has 11 states, 11 states have (on average 89.45454545454545) internal successors, (984), 11 states have internal predecessors, (984), 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-07-21 08:44:53,571 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:44:53,571 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 113 [2022-07-21 08:44:53,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:44:54,154 INFO L129 PetriNetUnfolder]: 672/1579 cut-off events. [2022-07-21 08:44:54,154 INFO L130 PetriNetUnfolder]: For 8488/9227 co-relation queries the response was YES. [2022-07-21 08:44:54,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6533 conditions, 1579 events. 672/1579 cut-off events. For 8488/9227 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10422 event pairs, 233 based on Foata normal form. 65/1555 useless extension candidates. Maximal degree in co-relation 6446. Up to 623 conditions per place. [2022-07-21 08:44:54,169 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 39 selfloop transitions, 15 changer transitions 38/170 dead transitions. [2022-07-21 08:44:54,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 170 transitions, 1124 flow [2022-07-21 08:44:54,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 08:44:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-21 08:44:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1583 transitions. [2022-07-21 08:44:54,173 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8240499739718896 [2022-07-21 08:44:54,173 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1583 transitions. [2022-07-21 08:44:54,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1583 transitions. [2022-07-21 08:44:54,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:44:54,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1583 transitions. [2022-07-21 08:44:54,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 93.11764705882354) internal successors, (1583), 17 states have internal predecessors, (1583), 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-07-21 08:44:54,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 113.0) internal successors, (2034), 18 states have internal predecessors, (2034), 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-07-21 08:44:54,179 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 113.0) internal successors, (2034), 18 states have internal predecessors, (2034), 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-07-21 08:44:54,179 INFO L186 Difference]: Start difference. First operand has 143 places, 109 transitions, 416 flow. Second operand 17 states and 1583 transitions. [2022-07-21 08:44:54,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 170 transitions, 1124 flow [2022-07-21 08:44:54,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 170 transitions, 1032 flow, removed 38 selfloop flow, removed 9 redundant places. [2022-07-21 08:44:54,190 INFO L242 Difference]: Finished difference. Result has 155 places, 113 transitions, 507 flow [2022-07-21 08:44:54,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=507, PETRI_PLACES=155, PETRI_TRANSITIONS=113} [2022-07-21 08:44:54,191 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 37 predicate places. [2022-07-21 08:44:54,191 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 113 transitions, 507 flow [2022-07-21 08:44:54,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.45454545454545) internal successors, (984), 11 states have internal predecessors, (984), 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-07-21 08:44:54,192 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:44:54,192 INFO L200 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, 1, 1, 1, 1, 1, 1] [2022-07-21 08:44:54,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 08:44:54,192 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:44:54,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:44:54,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1475487077, now seen corresponding path program 1 times [2022-07-21 08:44:54,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:44:54,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047217150] [2022-07-21 08:44:54,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:44:54,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:44:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:44:54,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:44:54,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:44:54,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047217150] [2022-07-21 08:44:54,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047217150] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:44:54,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:44:54,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:44:54,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758376665] [2022-07-21 08:44:54,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:44:54,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:44:54,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:44:54,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:44:54,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:44:54,276 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-07-21 08:44:54,277 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 113 transitions, 507 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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-07-21 08:44:54,277 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:44:54,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-07-21 08:44:54,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:44:54,717 INFO L129 PetriNetUnfolder]: 948/2326 cut-off events. [2022-07-21 08:44:54,717 INFO L130 PetriNetUnfolder]: For 20252/21253 co-relation queries the response was YES. [2022-07-21 08:44:54,727 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11587 conditions, 2326 events. 948/2326 cut-off events. For 20252/21253 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 17806 event pairs, 271 based on Foata normal form. 65/2255 useless extension candidates. Maximal degree in co-relation 11497. Up to 709 conditions per place. [2022-07-21 08:44:54,737 INFO L132 encePairwiseOnDemand]: 107/113 looper letters, 39 selfloop transitions, 3 changer transitions 29/153 dead transitions. [2022-07-21 08:44:54,737 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 153 transitions, 1089 flow [2022-07-21 08:44:54,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:44:54,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:44:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 877 transitions. [2022-07-21 08:44:54,739 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8623402163225172 [2022-07-21 08:44:54,739 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 877 transitions. [2022-07-21 08:44:54,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 877 transitions. [2022-07-21 08:44:54,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:44:54,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 877 transitions. [2022-07-21 08:44:54,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.44444444444444) internal successors, (877), 9 states have internal predecessors, (877), 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-07-21 08:44:54,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-07-21 08:44:54,743 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-07-21 08:44:54,743 INFO L186 Difference]: Start difference. First operand has 155 places, 113 transitions, 507 flow. Second operand 9 states and 877 transitions. [2022-07-21 08:44:54,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 153 transitions, 1089 flow [2022-07-21 08:44:54,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 153 transitions, 1023 flow, removed 27 selfloop flow, removed 10 redundant places. [2022-07-21 08:44:54,760 INFO L242 Difference]: Finished difference. Result has 151 places, 113 transitions, 498 flow [2022-07-21 08:44:54,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=498, PETRI_PLACES=151, PETRI_TRANSITIONS=113} [2022-07-21 08:44:54,761 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 33 predicate places. [2022-07-21 08:44:54,761 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 113 transitions, 498 flow [2022-07-21 08:44:54,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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-07-21 08:44:54,762 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:44:54,762 INFO L200 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, 1, 1, 1, 1, 1, 1] [2022-07-21 08:44:54,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 08:44:54,762 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:44:54,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:44:54,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1136446740, now seen corresponding path program 1 times [2022-07-21 08:44:54,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:44:54,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024752734] [2022-07-21 08:44:54,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:44:54,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:44:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:44:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:44:54,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:44:54,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024752734] [2022-07-21 08:44:54,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024752734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:44:54,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:44:54,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 08:44:54,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54743683] [2022-07-21 08:44:54,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:44:54,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 08:44:54,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:44:54,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 08:44:54,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-21 08:44:54,973 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2022-07-21 08:44:54,974 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 113 transitions, 498 flow. Second operand has 13 states, 13 states have (on average 88.3076923076923) internal successors, (1148), 13 states have internal predecessors, (1148), 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-07-21 08:44:54,974 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:44:54,974 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2022-07-21 08:44:54,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:44:55,673 INFO L129 PetriNetUnfolder]: 602/1580 cut-off events. [2022-07-21 08:44:55,673 INFO L130 PetriNetUnfolder]: For 12665/13204 co-relation queries the response was YES. [2022-07-21 08:44:55,701 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7572 conditions, 1580 events. 602/1580 cut-off events. For 12665/13204 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10870 event pairs, 344 based on Foata normal form. 28/1475 useless extension candidates. Maximal degree in co-relation 7479. Up to 810 conditions per place. [2022-07-21 08:44:55,713 INFO L132 encePairwiseOnDemand]: 100/113 looper letters, 30 selfloop transitions, 14 changer transitions 41/162 dead transitions. [2022-07-21 08:44:55,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 162 transitions, 1156 flow [2022-07-21 08:44:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 08:44:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-07-21 08:44:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1637 transitions. [2022-07-21 08:44:55,730 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8048180924287119 [2022-07-21 08:44:55,730 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1637 transitions. [2022-07-21 08:44:55,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1637 transitions. [2022-07-21 08:44:55,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:44:55,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1637 transitions. [2022-07-21 08:44:55,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 90.94444444444444) internal successors, (1637), 18 states have internal predecessors, (1637), 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-07-21 08:44:55,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 113.0) internal successors, (2147), 19 states have internal predecessors, (2147), 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-07-21 08:44:55,736 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 113.0) internal successors, (2147), 19 states have internal predecessors, (2147), 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-07-21 08:44:55,736 INFO L186 Difference]: Start difference. First operand has 151 places, 113 transitions, 498 flow. Second operand 18 states and 1637 transitions. [2022-07-21 08:44:55,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 162 transitions, 1156 flow [2022-07-21 08:44:55,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 162 transitions, 1085 flow, removed 34 selfloop flow, removed 7 redundant places. [2022-07-21 08:44:55,765 INFO L242 Difference]: Finished difference. Result has 166 places, 115 transitions, 562 flow [2022-07-21 08:44:55,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=562, PETRI_PLACES=166, PETRI_TRANSITIONS=115} [2022-07-21 08:44:55,766 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 48 predicate places. [2022-07-21 08:44:55,766 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 115 transitions, 562 flow [2022-07-21 08:44:55,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 88.3076923076923) internal successors, (1148), 13 states have internal predecessors, (1148), 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-07-21 08:44:55,766 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:44:55,766 INFO L200 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:44:55,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 08:44:55,767 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:44:55,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:44:55,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1341308941, now seen corresponding path program 1 times [2022-07-21 08:44:55,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:44:55,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584174512] [2022-07-21 08:44:55,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:44:55,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:44:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:44:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:44:55,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:44:55,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584174512] [2022-07-21 08:44:55,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584174512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:44:55,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:44:55,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:44:55,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223764872] [2022-07-21 08:44:55,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:44:55,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:44:55,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:44:55,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:44:55,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:44:55,998 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-21 08:44:55,998 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 115 transitions, 562 flow. Second operand has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 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-07-21 08:44:55,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:44:55,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-21 08:44:55,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:44:56,502 INFO L129 PetriNetUnfolder]: 764/1997 cut-off events. [2022-07-21 08:44:56,502 INFO L130 PetriNetUnfolder]: For 25595/26910 co-relation queries the response was YES. [2022-07-21 08:44:56,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11349 conditions, 1997 events. 764/1997 cut-off events. For 25595/26910 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 15483 event pairs, 190 based on Foata normal form. 98/1950 useless extension candidates. Maximal degree in co-relation 11247. Up to 610 conditions per place. [2022-07-21 08:44:56,521 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 32 selfloop transitions, 16 changer transitions 27/154 dead transitions. [2022-07-21 08:44:56,521 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 154 transitions, 1222 flow [2022-07-21 08:44:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:44:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-21 08:44:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1309 transitions. [2022-07-21 08:44:56,524 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.827433628318584 [2022-07-21 08:44:56,524 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1309 transitions. [2022-07-21 08:44:56,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1309 transitions. [2022-07-21 08:44:56,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:44:56,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1309 transitions. [2022-07-21 08:44:56,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 93.5) internal successors, (1309), 14 states have internal predecessors, (1309), 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-07-21 08:44:56,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-07-21 08:44:56,529 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 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-07-21 08:44:56,529 INFO L186 Difference]: Start difference. First operand has 166 places, 115 transitions, 562 flow. Second operand 14 states and 1309 transitions. [2022-07-21 08:44:56,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 154 transitions, 1222 flow [2022-07-21 08:44:56,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 154 transitions, 1116 flow, removed 42 selfloop flow, removed 16 redundant places. [2022-07-21 08:44:56,555 INFO L242 Difference]: Finished difference. Result has 161 places, 118 transitions, 621 flow [2022-07-21 08:44:56,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=621, PETRI_PLACES=161, PETRI_TRANSITIONS=118} [2022-07-21 08:44:56,556 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 43 predicate places. [2022-07-21 08:44:56,556 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 118 transitions, 621 flow [2022-07-21 08:44:56,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 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-07-21 08:44:56,557 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:44:56,557 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:44:56,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 08:44:56,557 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:44:56,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:44:56,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1583325092, now seen corresponding path program 1 times [2022-07-21 08:44:56,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:44:56,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147385620] [2022-07-21 08:44:56,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:44:56,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:44:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:44:56,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:44:56,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:44:56,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147385620] [2022-07-21 08:44:56,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147385620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:44:56,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:44:56,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:44:56,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961224866] [2022-07-21 08:44:56,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:44:56,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:44:56,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:44:56,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:44:56,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:44:56,620 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-21 08:44:56,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 118 transitions, 621 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 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-07-21 08:44:56,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:44:56,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-21 08:44:56,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:44:57,633 INFO L129 PetriNetUnfolder]: 3998/7295 cut-off events. [2022-07-21 08:44:57,634 INFO L130 PetriNetUnfolder]: For 121578/123034 co-relation queries the response was YES. [2022-07-21 08:44:57,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38967 conditions, 7295 events. 3998/7295 cut-off events. For 121578/123034 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 56222 event pairs, 240 based on Foata normal form. 427/7316 useless extension candidates. Maximal degree in co-relation 38873. Up to 2323 conditions per place. [2022-07-21 08:44:57,677 INFO L132 encePairwiseOnDemand]: 103/113 looper letters, 55 selfloop transitions, 6 changer transitions 93/236 dead transitions. [2022-07-21 08:44:57,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 236 transitions, 2240 flow [2022-07-21 08:44:57,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:44:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:44:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 972 transitions. [2022-07-21 08:44:57,679 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8601769911504424 [2022-07-21 08:44:57,680 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 972 transitions. [2022-07-21 08:44:57,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 972 transitions. [2022-07-21 08:44:57,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:44:57,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 972 transitions. [2022-07-21 08:44:57,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.2) internal successors, (972), 10 states have internal predecessors, (972), 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-07-21 08:44:57,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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-07-21 08:44:57,683 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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-07-21 08:44:57,683 INFO L186 Difference]: Start difference. First operand has 161 places, 118 transitions, 621 flow. Second operand 10 states and 972 transitions. [2022-07-21 08:44:57,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 236 transitions, 2240 flow [2022-07-21 08:44:57,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 236 transitions, 1977 flow, removed 95 selfloop flow, removed 12 redundant places. [2022-07-21 08:44:57,753 INFO L242 Difference]: Finished difference. Result has 158 places, 118 transitions, 598 flow [2022-07-21 08:44:57,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=598, PETRI_PLACES=158, PETRI_TRANSITIONS=118} [2022-07-21 08:44:57,754 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 40 predicate places. [2022-07-21 08:44:57,754 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 118 transitions, 598 flow [2022-07-21 08:44:57,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 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-07-21 08:44:57,754 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:44:57,754 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:44:57,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 08:44:57,755 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:44:57,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:44:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash 633851726, now seen corresponding path program 1 times [2022-07-21 08:44:57,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:44:57,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556523712] [2022-07-21 08:44:57,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:44:57,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:44:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:44:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:44:57,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:44:57,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556523712] [2022-07-21 08:44:57,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556523712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:44:57,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:44:57,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:44:57,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946546910] [2022-07-21 08:44:57,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:44:57,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:44:57,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:44:57,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:44:57,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:44:57,826 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-21 08:44:57,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 118 transitions, 598 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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-07-21 08:44:57,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:44:57,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-21 08:44:57,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:44:58,476 INFO L129 PetriNetUnfolder]: 1288/2841 cut-off events. [2022-07-21 08:44:58,476 INFO L130 PetriNetUnfolder]: For 35311/35725 co-relation queries the response was YES. [2022-07-21 08:44:58,499 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14793 conditions, 2841 events. 1288/2841 cut-off events. For 35311/35725 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 21301 event pairs, 31 based on Foata normal form. 251/3022 useless extension candidates. Maximal degree in co-relation 14701. Up to 790 conditions per place. [2022-07-21 08:44:58,505 INFO L132 encePairwiseOnDemand]: 104/113 looper letters, 52 selfloop transitions, 9 changer transitions 58/201 dead transitions. [2022-07-21 08:44:58,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 201 transitions, 1802 flow [2022-07-21 08:44:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:44:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:44:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 970 transitions. [2022-07-21 08:44:58,507 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8584070796460177 [2022-07-21 08:44:58,507 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 970 transitions. [2022-07-21 08:44:58,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 970 transitions. [2022-07-21 08:44:58,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:44:58,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 970 transitions. [2022-07-21 08:44:58,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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-07-21 08:44:58,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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-07-21 08:44:58,512 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 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-07-21 08:44:58,512 INFO L186 Difference]: Start difference. First operand has 158 places, 118 transitions, 598 flow. Second operand 10 states and 970 transitions. [2022-07-21 08:44:58,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 201 transitions, 1802 flow [2022-07-21 08:44:58,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 201 transitions, 1689 flow, removed 26 selfloop flow, removed 9 redundant places. [2022-07-21 08:44:58,540 INFO L242 Difference]: Finished difference. Result has 158 places, 119 transitions, 621 flow [2022-07-21 08:44:58,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=621, PETRI_PLACES=158, PETRI_TRANSITIONS=119} [2022-07-21 08:44:58,542 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 40 predicate places. [2022-07-21 08:44:58,543 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 119 transitions, 621 flow [2022-07-21 08:44:58,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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-07-21 08:44:58,543 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:44:58,543 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:44:58,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 08:44:58,543 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:44:58,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:44:58,544 INFO L85 PathProgramCache]: Analyzing trace with hash 367883124, now seen corresponding path program 1 times [2022-07-21 08:44:58,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:44:58,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202693401] [2022-07-21 08:44:58,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:44:58,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:44:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:44:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:44:58,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:44:58,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202693401] [2022-07-21 08:44:58,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202693401] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:44:58,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:44:58,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:44:58,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630511166] [2022-07-21 08:44:58,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:44:58,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:44:58,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:44:58,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:44:58,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:44:58,633 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-07-21 08:44:58,634 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 119 transitions, 621 flow. Second operand has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 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-07-21 08:44:58,634 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:44:58,634 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-07-21 08:44:58,634 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:44:58,945 INFO L129 PetriNetUnfolder]: 389/1151 cut-off events. [2022-07-21 08:44:58,945 INFO L130 PetriNetUnfolder]: For 10743/10946 co-relation queries the response was YES. [2022-07-21 08:44:58,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5735 conditions, 1151 events. 389/1151 cut-off events. For 10743/10946 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7844 event pairs, 17 based on Foata normal form. 58/1187 useless extension candidates. Maximal degree in co-relation 5642. Up to 271 conditions per place. [2022-07-21 08:44:58,952 INFO L132 encePairwiseOnDemand]: 104/113 looper letters, 33 selfloop transitions, 12 changer transitions 39/164 dead transitions. [2022-07-21 08:44:58,952 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 164 transitions, 1314 flow [2022-07-21 08:44:58,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 08:44:58,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-21 08:44:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1038 transitions. [2022-07-21 08:44:58,954 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.835076427996782 [2022-07-21 08:44:58,954 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1038 transitions. [2022-07-21 08:44:58,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1038 transitions. [2022-07-21 08:44:58,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:44:58,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1038 transitions. [2022-07-21 08:44:58,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.36363636363636) internal successors, (1038), 11 states have internal predecessors, (1038), 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-07-21 08:44:58,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 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-07-21 08:44:58,957 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 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-07-21 08:44:58,958 INFO L186 Difference]: Start difference. First operand has 158 places, 119 transitions, 621 flow. Second operand 11 states and 1038 transitions. [2022-07-21 08:44:58,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 164 transitions, 1314 flow [2022-07-21 08:44:58,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 164 transitions, 1031 flow, removed 128 selfloop flow, removed 19 redundant places. [2022-07-21 08:44:58,972 INFO L242 Difference]: Finished difference. Result has 151 places, 111 transitions, 467 flow [2022-07-21 08:44:58,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=467, PETRI_PLACES=151, PETRI_TRANSITIONS=111} [2022-07-21 08:44:58,973 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 33 predicate places. [2022-07-21 08:44:58,973 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 111 transitions, 467 flow [2022-07-21 08:44:58,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 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-07-21 08:44:58,974 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:44:58,974 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:44:58,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 08:44:58,974 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:44:58,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:44:58,975 INFO L85 PathProgramCache]: Analyzing trace with hash 682024245, now seen corresponding path program 1 times [2022-07-21 08:44:58,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:44:58,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103715342] [2022-07-21 08:44:58,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:44:58,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:44:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:44:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:44:59,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:44:59,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103715342] [2022-07-21 08:44:59,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103715342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:44:59,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:44:59,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-21 08:44:59,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458269759] [2022-07-21 08:44:59,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:44:59,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 08:44:59,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:44:59,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 08:44:59,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-07-21 08:44:59,274 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 113 [2022-07-21 08:44:59,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 111 transitions, 467 flow. Second operand has 14 states, 14 states have (on average 86.64285714285714) internal successors, (1213), 14 states have internal predecessors, (1213), 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-07-21 08:44:59,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:44:59,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 113 [2022-07-21 08:44:59,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:44:59,705 INFO L129 PetriNetUnfolder]: 125/786 cut-off events. [2022-07-21 08:44:59,705 INFO L130 PetriNetUnfolder]: For 2584/2716 co-relation queries the response was YES. [2022-07-21 08:44:59,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 786 events. 125/786 cut-off events. For 2584/2716 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6014 event pairs, 0 based on Foata normal form. 14/780 useless extension candidates. Maximal degree in co-relation 2414. Up to 157 conditions per place. [2022-07-21 08:44:59,710 INFO L132 encePairwiseOnDemand]: 101/113 looper letters, 21 selfloop transitions, 12 changer transitions 15/126 dead transitions. [2022-07-21 08:44:59,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 126 transitions, 647 flow [2022-07-21 08:44:59,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 08:44:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-21 08:44:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1317 transitions. [2022-07-21 08:44:59,723 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7769911504424779 [2022-07-21 08:44:59,723 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1317 transitions. [2022-07-21 08:44:59,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1317 transitions. [2022-07-21 08:44:59,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:44:59,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1317 transitions. [2022-07-21 08:44:59,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 87.8) internal successors, (1317), 15 states have internal predecessors, (1317), 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-07-21 08:44:59,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 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-07-21 08:44:59,728 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 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-07-21 08:44:59,728 INFO L186 Difference]: Start difference. First operand has 151 places, 111 transitions, 467 flow. Second operand 15 states and 1317 transitions. [2022-07-21 08:44:59,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 126 transitions, 647 flow [2022-07-21 08:44:59,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 126 transitions, 491 flow, removed 56 selfloop flow, removed 25 redundant places. [2022-07-21 08:44:59,736 INFO L242 Difference]: Finished difference. Result has 142 places, 108 transitions, 378 flow [2022-07-21 08:44:59,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=378, PETRI_PLACES=142, PETRI_TRANSITIONS=108} [2022-07-21 08:44:59,737 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 24 predicate places. [2022-07-21 08:44:59,737 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 108 transitions, 378 flow [2022-07-21 08:44:59,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 86.64285714285714) internal successors, (1213), 14 states have internal predecessors, (1213), 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-07-21 08:44:59,737 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:44:59,738 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:44:59,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 08:44:59,738 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-21 08:44:59,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:44:59,739 INFO L85 PathProgramCache]: Analyzing trace with hash 37696987, now seen corresponding path program 2 times [2022-07-21 08:44:59,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:44:59,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308679690] [2022-07-21 08:44:59,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:44:59,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:44:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:44:59,778 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 08:44:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:44:59,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 08:44:59,860 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 08:44:59,861 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-21 08:44:59,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-21 08:44:59,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-21 08:44:59,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-21 08:44:59,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-21 08:44:59,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-21 08:44:59,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 08:44:59,867 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:44:59,872 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-21 08:44:59,873 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 08:44:59,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 08:44:59 BasicIcfg [2022-07-21 08:44:59,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 08:44:59,992 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 08:44:59,992 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 08:44:59,992 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 08:44:59,992 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:44:49" (3/4) ... [2022-07-21 08:44:59,994 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 08:45:00,070 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 08:45:00,070 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 08:45:00,071 INFO L158 Benchmark]: Toolchain (without parser) took 11247.63ms. Allocated memory was 65.0MB in the beginning and 658.5MB in the end (delta: 593.5MB). Free memory was 44.0MB in the beginning and 278.2MB in the end (delta: -234.2MB). Peak memory consumption was 358.4MB. Max. memory is 16.1GB. [2022-07-21 08:45:00,071 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 65.0MB. Free memory was 47.4MB in the beginning and 47.3MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 08:45:00,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.32ms. Allocated memory is still 65.0MB. Free memory was 43.9MB in the beginning and 35.4MB in the end (delta: 8.5MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2022-07-21 08:45:00,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.58ms. Allocated memory is still 65.0MB. Free memory was 35.4MB in the beginning and 32.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 08:45:00,072 INFO L158 Benchmark]: Boogie Preprocessor took 21.30ms. Allocated memory is still 65.0MB. Free memory was 32.3MB in the beginning and 30.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 08:45:00,072 INFO L158 Benchmark]: RCFGBuilder took 738.96ms. Allocated memory was 65.0MB in the beginning and 94.4MB in the end (delta: 29.4MB). Free memory was 30.2MB in the beginning and 47.0MB in the end (delta: -16.8MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2022-07-21 08:45:00,072 INFO L158 Benchmark]: TraceAbstraction took 10009.80ms. Allocated memory was 94.4MB in the beginning and 658.5MB in the end (delta: 564.1MB). Free memory was 46.2MB in the beginning and 302.3MB in the end (delta: -256.1MB). Peak memory consumption was 307.5MB. Max. memory is 16.1GB. [2022-07-21 08:45:00,073 INFO L158 Benchmark]: Witness Printer took 78.47ms. Allocated memory is still 658.5MB. Free memory was 302.3MB in the beginning and 278.2MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-07-21 08:45:00,075 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.21ms. Allocated memory is still 65.0MB. Free memory was 47.4MB in the beginning and 47.3MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.32ms. Allocated memory is still 65.0MB. Free memory was 43.9MB in the beginning and 35.4MB in the end (delta: 8.5MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.58ms. Allocated memory is still 65.0MB. Free memory was 35.4MB in the beginning and 32.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.30ms. Allocated memory is still 65.0MB. Free memory was 32.3MB in the beginning and 30.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 738.96ms. Allocated memory was 65.0MB in the beginning and 94.4MB in the end (delta: 29.4MB). Free memory was 30.2MB in the beginning and 47.0MB in the end (delta: -16.8MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10009.80ms. Allocated memory was 94.4MB in the beginning and 658.5MB in the end (delta: 564.1MB). Free memory was 46.2MB in the beginning and 302.3MB in the end (delta: -256.1MB). Peak memory consumption was 307.5MB. Max. memory is 16.1GB. * Witness Printer took 78.47ms. Allocated memory is still 658.5MB. Free memory was 302.3MB in the beginning and 278.2MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L724] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L725] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L726] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L727] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 pthread_t t2489; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-2, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=-1, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2491; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0: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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0: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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L788] 3 y = 2 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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0: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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, 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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, 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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 821]: 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: 817]: 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: 819]: 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 7 procedures, 140 locations, 6 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: 9.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 733 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 733 mSDsluCounter, 610 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1064 mSDsCounter, 240 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1747 IncrementalHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 240 mSolverCounterUnsat, 128 mSDtfsCounter, 1747 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=621occurred in iteration=10, InterpolantAutomatonStates: 161, 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.5s InterpolantComputationTime, 1150 NumberOfCodeBlocks, 1150 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1049 ConstructedInterpolants, 0 QuantifiedInterpolants, 6103 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-07-21 08:45:00,123 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE