./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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.opt_pso.opt_rmo.opt.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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 21:27:01,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:27:01,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:27:01,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:27:01,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:27:01,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:27:01,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:27:01,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:27:01,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:27:01,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:27:01,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:27:01,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:27:01,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:27:01,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:27:01,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:27:01,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:27:01,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:27:01,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:27:01,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:27:01,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:27:01,210 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:27:01,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:27:01,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:27:01,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:27:01,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:27:01,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:27:01,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:27:01,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:27:01,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:27:01,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:27:01,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:27:01,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:27:01,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:27:01,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:27:01,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:27:01,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:27:01,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:27:01,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:27:01,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:27:01,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:27:01,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:27:01,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:27:01,234 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 21:27:01,258 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:27:01,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:27:01,259 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:27:01,259 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:27:01,260 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:27:01,260 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:27:01,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:27:01,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:27:01,261 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:27:01,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:27:01,262 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:27:01,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:27:01,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:27:01,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:27:01,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:27:01,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:27:01,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:27:01,263 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:27:01,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:27:01,264 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:27:01,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:27:01,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:27:01,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:27:01,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:27:01,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:27:01,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:27:01,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:27:01,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:27:01,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:27:01,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:27:01,266 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:27:01,266 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:27:01,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:27:01,266 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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 [2022-07-22 21:27:01,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:27:01,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:27:01,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:27:01,486 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:27:01,487 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:27:01,488 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-07-22 21:27:01,539 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1bbff076/02a5a9ac64954e5080d1d4cff59d8268/FLAG9287e36a2 [2022-07-22 21:27:02,024 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:27:02,024 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-07-22 21:27:02,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1bbff076/02a5a9ac64954e5080d1d4cff59d8268/FLAG9287e36a2 [2022-07-22 21:27:02,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1bbff076/02a5a9ac64954e5080d1d4cff59d8268 [2022-07-22 21:27:02,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:27:02,054 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:27:02,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:27:02,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:27:02,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:27:02,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:27:02" (1/1) ... [2022-07-22 21:27:02,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e533b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:27:02, skipping insertion in model container [2022-07-22 21:27:02,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:27:02" (1/1) ... [2022-07-22 21:27:02,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:27:02,100 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:27:02,244 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.opt_pso.opt_rmo.opt.i[967,980] [2022-07-22 21:27:02,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:27:02,411 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:27:02,421 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.opt_pso.opt_rmo.opt.i[967,980] [2022-07-22 21:27:02,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:27:02,507 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:27:02,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:27:02 WrapperNode [2022-07-22 21:27:02,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:27:02,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:27:02,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:27:02,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:27:02,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:27:02" (1/1) ... [2022-07-22 21:27:02,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:27:02" (1/1) ... [2022-07-22 21:27:02,571 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 273 [2022-07-22 21:27:02,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:27:02,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:27:02,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:27:02,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:27:02,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:27:02" (1/1) ... [2022-07-22 21:27:02,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:27:02" (1/1) ... [2022-07-22 21:27:02,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:27:02" (1/1) ... [2022-07-22 21:27:02,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:27:02" (1/1) ... [2022-07-22 21:27:02,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:27:02" (1/1) ... [2022-07-22 21:27:02,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:27:02" (1/1) ... [2022-07-22 21:27:02,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:27:02" (1/1) ... [2022-07-22 21:27:02,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:27:02,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:27:02,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:27:02,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:27:02,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:27:02" (1/1) ... [2022-07-22 21:27:02,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:27:02,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:27:02,619 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-22 21:27:02,633 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-22 21:27:02,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:27:02,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 21:27:02,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:27:02,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:27:02,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:27:02,673 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-22 21:27:02,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-22 21:27:02,673 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-22 21:27:02,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-22 21:27:02,674 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-22 21:27:02,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-22 21:27:02,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:27:02,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 21:27:02,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:27:02,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:27:02,675 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 21:27:02,785 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:27:02,786 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:27:03,084 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:27:03,355 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:27:03,356 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 21:27:03,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:27:03 BoogieIcfgContainer [2022-07-22 21:27:03,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:27:03,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:27:03,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:27:03,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:27:03,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:27:02" (1/3) ... [2022-07-22 21:27:03,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494e3381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:27:03, skipping insertion in model container [2022-07-22 21:27:03,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:27:02" (2/3) ... [2022-07-22 21:27:03,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494e3381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:27:03, skipping insertion in model container [2022-07-22 21:27:03,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:27:03" (3/3) ... [2022-07-22 21:27:03,364 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2022-07-22 21:27:03,368 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:27:03,374 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:27:03,374 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-22 21:27:03,374 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:27:03,417 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-22 21:27:03,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-07-22 21:27:03,483 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2022-07-22 21:27:03,483 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:27:03,487 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-07-22 21:27:03,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-07-22 21:27:03,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-07-22 21:27:03,507 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:27:03,513 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@18b67539, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7cce9e33 [2022-07-22 21:27:03,514 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-22 21:27:03,526 INFO L129 PetriNetUnfolder]: 0/71 cut-off events. [2022-07-22 21:27:03,528 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:27:03,528 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:03,529 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] [2022-07-22 21:27:03,529 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:27:03,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:03,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2040665683, now seen corresponding path program 1 times [2022-07-22 21:27:03,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:03,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560804507] [2022-07-22 21:27:03,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:03,836 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-22 21:27:03,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:03,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560804507] [2022-07-22 21:27:03,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560804507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:03,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:03,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 21:27:03,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295191494] [2022-07-22 21:27:03,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:03,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:27:03,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:03,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:27:03,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:27:03,878 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 112 [2022-07-22 21:27:03,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-22 21:27:03,881 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:03,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 112 [2022-07-22 21:27:03,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:04,014 INFO L129 PetriNetUnfolder]: 17/241 cut-off events. [2022-07-22 21:27:04,015 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-22 21:27:04,017 INFO L84 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 241 events. 17/241 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 754 event pairs, 7 based on Foata normal form. 8/237 useless extension candidates. Maximal degree in co-relation 243. Up to 27 conditions per place. [2022-07-22 21:27:04,019 INFO L132 encePairwiseOnDemand]: 107/112 looper letters, 10 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2022-07-22 21:27:04,020 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 108 transitions, 249 flow [2022-07-22 21:27:04,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:27:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:27:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-07-22 21:27:04,038 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9345238095238095 [2022-07-22 21:27:04,039 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2022-07-22 21:27:04,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2022-07-22 21:27:04,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:04,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2022-07-22 21:27:04,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-22 21:27:04,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:27:04,057 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:27:04,058 INFO L186 Difference]: Start difference. First operand has 117 places, 109 transitions, 227 flow. Second operand 3 states and 314 transitions. [2022-07-22 21:27:04,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 108 transitions, 249 flow [2022-07-22 21:27:04,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 108 transitions, 246 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-22 21:27:04,067 INFO L242 Difference]: Finished difference. Result has 114 places, 105 transitions, 220 flow [2022-07-22 21:27:04,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2022-07-22 21:27:04,072 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2022-07-22 21:27:04,073 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 220 flow [2022-07-22 21:27:04,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-22 21:27:04,074 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:04,074 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-22 21:27:04,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:27:04,075 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:27:04,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:04,076 INFO L85 PathProgramCache]: Analyzing trace with hash -690634123, now seen corresponding path program 1 times [2022-07-22 21:27:04,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:04,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152606221] [2022-07-22 21:27:04,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:04,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:04,269 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-22 21:27:04,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:04,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152606221] [2022-07-22 21:27:04,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152606221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:04,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:04,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:27:04,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739292336] [2022-07-22 21:27:04,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:04,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:27:04,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:04,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:27:04,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:27:04,279 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-07-22 21:27:04,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 220 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-22 21:27:04,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:04,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-07-22 21:27:04,284 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:04,576 INFO L129 PetriNetUnfolder]: 357/1164 cut-off events. [2022-07-22 21:27:04,577 INFO L130 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-07-22 21:27:04,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1841 conditions, 1164 events. 357/1164 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7950 event pairs, 56 based on Foata normal form. 0/1130 useless extension candidates. Maximal degree in co-relation 1791. Up to 333 conditions per place. [2022-07-22 21:27:04,584 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 20 selfloop transitions, 3 changer transitions 48/148 dead transitions. [2022-07-22 21:27:04,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 148 transitions, 444 flow [2022-07-22 21:27:04,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:27:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:27:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2022-07-22 21:27:04,588 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8740079365079365 [2022-07-22 21:27:04,588 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 881 transitions. [2022-07-22 21:27:04,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions. [2022-07-22 21:27:04,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:04,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions. [2022-07-22 21:27:04,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.88888888888889) internal successors, (881), 9 states have internal predecessors, (881), 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-22 21:27:04,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-22 21:27:04,594 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-22 21:27:04,594 INFO L186 Difference]: Start difference. First operand has 114 places, 105 transitions, 220 flow. Second operand 9 states and 881 transitions. [2022-07-22 21:27:04,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 148 transitions, 444 flow [2022-07-22 21:27:04,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 148 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:27:04,598 INFO L242 Difference]: Finished difference. Result has 127 places, 95 transitions, 235 flow [2022-07-22 21:27:04,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=235, PETRI_PLACES=127, PETRI_TRANSITIONS=95} [2022-07-22 21:27:04,600 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 10 predicate places. [2022-07-22 21:27:04,600 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 95 transitions, 235 flow [2022-07-22 21:27:04,600 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-22 21:27:04,600 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:04,601 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] [2022-07-22 21:27:04,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:27:04,601 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:27:04,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:04,602 INFO L85 PathProgramCache]: Analyzing trace with hash -909743756, now seen corresponding path program 1 times [2022-07-22 21:27:04,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:04,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202060612] [2022-07-22 21:27:04,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:04,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:04,784 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-22 21:27:04,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:04,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202060612] [2022-07-22 21:27:04,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202060612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:04,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:04,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:27:04,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764634379] [2022-07-22 21:27:04,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:04,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:27:04,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:04,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:27:04,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:27:04,789 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-07-22 21:27:04,790 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 95 transitions, 235 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-22 21:27:04,790 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:04,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-07-22 21:27:04,790 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:05,032 INFO L129 PetriNetUnfolder]: 387/953 cut-off events. [2022-07-22 21:27:05,032 INFO L130 PetriNetUnfolder]: For 735/739 co-relation queries the response was YES. [2022-07-22 21:27:05,035 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 953 events. 387/953 cut-off events. For 735/739 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5545 event pairs, 178 based on Foata normal form. 24/927 useless extension candidates. Maximal degree in co-relation 2060. Up to 348 conditions per place. [2022-07-22 21:27:05,040 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 20 selfloop transitions, 3 changer transitions 34/136 dead transitions. [2022-07-22 21:27:05,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 136 transitions, 453 flow [2022-07-22 21:27:05,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:27:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:27:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 878 transitions. [2022-07-22 21:27:05,043 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.871031746031746 [2022-07-22 21:27:05,043 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 878 transitions. [2022-07-22 21:27:05,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 878 transitions. [2022-07-22 21:27:05,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:05,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 878 transitions. [2022-07-22 21:27:05,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.55555555555556) internal successors, (878), 9 states have internal predecessors, (878), 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-22 21:27:05,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-22 21:27:05,048 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-22 21:27:05,048 INFO L186 Difference]: Start difference. First operand has 127 places, 95 transitions, 235 flow. Second operand 9 states and 878 transitions. [2022-07-22 21:27:05,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 136 transitions, 453 flow [2022-07-22 21:27:05,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 136 transitions, 436 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-07-22 21:27:05,058 INFO L242 Difference]: Finished difference. Result has 120 places, 97 transitions, 269 flow [2022-07-22 21:27:05,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=269, PETRI_PLACES=120, PETRI_TRANSITIONS=97} [2022-07-22 21:27:05,060 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 3 predicate places. [2022-07-22 21:27:05,060 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 97 transitions, 269 flow [2022-07-22 21:27:05,060 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-22 21:27:05,060 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:05,061 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-22 21:27:05,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 21:27:05,061 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:27:05,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:05,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2085786923, now seen corresponding path program 1 times [2022-07-22 21:27:05,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:05,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132901866] [2022-07-22 21:27:05,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:05,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:05,296 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-22 21:27:05,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:05,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132901866] [2022-07-22 21:27:05,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132901866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:05,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:05,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 21:27:05,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896286016] [2022-07-22 21:27:05,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:05,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 21:27:05,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:05,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 21:27:05,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-22 21:27:05,298 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 112 [2022-07-22 21:27:05,299 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 97 transitions, 269 flow. Second operand has 9 states, 9 states have (on average 91.44444444444444) internal successors, (823), 9 states have internal predecessors, (823), 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-22 21:27:05,299 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:05,299 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 112 [2022-07-22 21:27:05,299 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:05,721 INFO L129 PetriNetUnfolder]: 437/1046 cut-off events. [2022-07-22 21:27:05,721 INFO L130 PetriNetUnfolder]: For 1823/1832 co-relation queries the response was YES. [2022-07-22 21:27:05,727 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 1046 events. 437/1046 cut-off events. For 1823/1832 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6239 event pairs, 163 based on Foata normal form. 29/1018 useless extension candidates. Maximal degree in co-relation 2756. Up to 401 conditions per place. [2022-07-22 21:27:05,731 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 16 selfloop transitions, 9 changer transitions 34/139 dead transitions. [2022-07-22 21:27:05,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 139 transitions, 517 flow [2022-07-22 21:27:05,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 21:27:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-22 21:27:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1322 transitions. [2022-07-22 21:27:05,735 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8431122448979592 [2022-07-22 21:27:05,735 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1322 transitions. [2022-07-22 21:27:05,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1322 transitions. [2022-07-22 21:27:05,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:05,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1322 transitions. [2022-07-22 21:27:05,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 94.42857142857143) internal successors, (1322), 14 states have internal predecessors, (1322), 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-22 21:27:05,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 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-22 21:27:05,746 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 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-22 21:27:05,746 INFO L186 Difference]: Start difference. First operand has 120 places, 97 transitions, 269 flow. Second operand 14 states and 1322 transitions. [2022-07-22 21:27:05,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 139 transitions, 517 flow [2022-07-22 21:27:05,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 139 transitions, 496 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-07-22 21:27:05,753 INFO L242 Difference]: Finished difference. Result has 134 places, 103 transitions, 346 flow [2022-07-22 21:27:05,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=346, PETRI_PLACES=134, PETRI_TRANSITIONS=103} [2022-07-22 21:27:05,756 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 17 predicate places. [2022-07-22 21:27:05,756 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 103 transitions, 346 flow [2022-07-22 21:27:05,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.44444444444444) internal successors, (823), 9 states have internal predecessors, (823), 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-22 21:27:05,758 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:05,758 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-22 21:27:05,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:27:05,758 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:27:05,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:05,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1195724569, now seen corresponding path program 1 times [2022-07-22 21:27:05,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:05,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344801428] [2022-07-22 21:27:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:05,893 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-22 21:27:05,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:05,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344801428] [2022-07-22 21:27:05,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344801428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:05,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:05,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:27:05,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404077652] [2022-07-22 21:27:05,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:05,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:27:05,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:05,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:27:05,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:27:05,895 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-07-22 21:27:05,895 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 103 transitions, 346 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-22 21:27:05,895 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:05,895 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-07-22 21:27:05,895 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:06,506 INFO L129 PetriNetUnfolder]: 457/1170 cut-off events. [2022-07-22 21:27:06,506 INFO L130 PetriNetUnfolder]: For 4992/5182 co-relation queries the response was YES. [2022-07-22 21:27:06,511 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4444 conditions, 1170 events. 457/1170 cut-off events. For 4992/5182 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7327 event pairs, 192 based on Foata normal form. 20/1137 useless extension candidates. Maximal degree in co-relation 4370. Up to 366 conditions per place. [2022-07-22 21:27:06,515 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 32 selfloop transitions, 3 changer transitions 26/142 dead transitions. [2022-07-22 21:27:06,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 142 transitions, 759 flow [2022-07-22 21:27:06,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:27:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:27:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 873 transitions. [2022-07-22 21:27:06,525 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8660714285714286 [2022-07-22 21:27:06,525 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 873 transitions. [2022-07-22 21:27:06,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 873 transitions. [2022-07-22 21:27:06,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:06,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 873 transitions. [2022-07-22 21:27:06,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 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-22 21:27:06,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-22 21:27:06,528 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-22 21:27:06,528 INFO L186 Difference]: Start difference. First operand has 134 places, 103 transitions, 346 flow. Second operand 9 states and 873 transitions. [2022-07-22 21:27:06,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 142 transitions, 759 flow [2022-07-22 21:27:06,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 142 transitions, 729 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-07-22 21:27:06,540 INFO L242 Difference]: Finished difference. Result has 136 places, 103 transitions, 361 flow [2022-07-22 21:27:06,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=361, PETRI_PLACES=136, PETRI_TRANSITIONS=103} [2022-07-22 21:27:06,541 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 19 predicate places. [2022-07-22 21:27:06,541 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 103 transitions, 361 flow [2022-07-22 21:27:06,541 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-22 21:27:06,541 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:06,541 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-22 21:27:06,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 21:27:06,542 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:27:06,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:06,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1553593508, now seen corresponding path program 1 times [2022-07-22 21:27:06,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:06,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398331966] [2022-07-22 21:27:06,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:06,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:06,645 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-22 21:27:06,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:06,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398331966] [2022-07-22 21:27:06,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398331966] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:06,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:06,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:27:06,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807231033] [2022-07-22 21:27:06,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:06,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:27:06,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:06,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:27:06,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:27:06,648 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 112 [2022-07-22 21:27:06,649 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 103 transitions, 361 flow. Second operand has 8 states, 8 states have (on average 91.75) internal successors, (734), 8 states have internal predecessors, (734), 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-22 21:27:06,649 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:06,649 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 112 [2022-07-22 21:27:06,649 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:06,923 INFO L129 PetriNetUnfolder]: 382/1061 cut-off events. [2022-07-22 21:27:06,923 INFO L130 PetriNetUnfolder]: For 5574/5675 co-relation queries the response was YES. [2022-07-22 21:27:06,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4089 conditions, 1061 events. 382/1061 cut-off events. For 5574/5675 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6889 event pairs, 128 based on Foata normal form. 25/996 useless extension candidates. Maximal degree in co-relation 4009. Up to 384 conditions per place. [2022-07-22 21:27:06,933 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 26 selfloop transitions, 8 changer transitions 19/133 dead transitions. [2022-07-22 21:27:06,934 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 133 transitions, 693 flow [2022-07-22 21:27:06,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 21:27:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-22 21:27:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1040 transitions. [2022-07-22 21:27:06,936 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8441558441558441 [2022-07-22 21:27:06,936 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1040 transitions. [2022-07-22 21:27:06,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1040 transitions. [2022-07-22 21:27:06,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:06,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1040 transitions. [2022-07-22 21:27:06,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.54545454545455) internal successors, (1040), 11 states have internal predecessors, (1040), 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-22 21:27:06,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 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-22 21:27:06,941 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 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-22 21:27:06,941 INFO L186 Difference]: Start difference. First operand has 136 places, 103 transitions, 361 flow. Second operand 11 states and 1040 transitions. [2022-07-22 21:27:06,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 133 transitions, 693 flow [2022-07-22 21:27:06,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 133 transitions, 644 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-07-22 21:27:06,949 INFO L242 Difference]: Finished difference. Result has 140 places, 106 transitions, 394 flow [2022-07-22 21:27:06,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=394, PETRI_PLACES=140, PETRI_TRANSITIONS=106} [2022-07-22 21:27:06,950 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 23 predicate places. [2022-07-22 21:27:06,950 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 106 transitions, 394 flow [2022-07-22 21:27:06,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.75) internal successors, (734), 8 states have internal predecessors, (734), 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-22 21:27:06,951 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:06,951 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-22 21:27:06,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 21:27:06,951 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:27:06,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:06,952 INFO L85 PathProgramCache]: Analyzing trace with hash 703272026, now seen corresponding path program 2 times [2022-07-22 21:27:06,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:06,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843133045] [2022-07-22 21:27:06,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:06,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:07,148 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-22 21:27:07,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:07,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843133045] [2022-07-22 21:27:07,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843133045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:07,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:07,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 21:27:07,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002887401] [2022-07-22 21:27:07,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:07,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 21:27:07,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:07,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 21:27:07,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-22 21:27:07,150 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-07-22 21:27:07,151 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 106 transitions, 394 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-22 21:27:07,151 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:07,151 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-07-22 21:27:07,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:07,413 INFO L129 PetriNetUnfolder]: 349/1001 cut-off events. [2022-07-22 21:27:07,413 INFO L130 PetriNetUnfolder]: For 5363/5644 co-relation queries the response was YES. [2022-07-22 21:27:07,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3963 conditions, 1001 events. 349/1001 cut-off events. For 5363/5644 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6455 event pairs, 112 based on Foata normal form. 28/962 useless extension candidates. Maximal degree in co-relation 3879. Up to 360 conditions per place. [2022-07-22 21:27:07,422 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 24 selfloop transitions, 7 changer transitions 19/129 dead transitions. [2022-07-22 21:27:07,422 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 129 transitions, 678 flow [2022-07-22 21:27:07,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 21:27:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-22 21:27:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1113 transitions. [2022-07-22 21:27:07,425 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.828125 [2022-07-22 21:27:07,425 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1113 transitions. [2022-07-22 21:27:07,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1113 transitions. [2022-07-22 21:27:07,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:07,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1113 transitions. [2022-07-22 21:27:07,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 92.75) internal successors, (1113), 12 states have internal predecessors, (1113), 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-22 21:27:07,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 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-22 21:27:07,429 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 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-22 21:27:07,430 INFO L186 Difference]: Start difference. First operand has 140 places, 106 transitions, 394 flow. Second operand 12 states and 1113 transitions. [2022-07-22 21:27:07,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 129 transitions, 678 flow [2022-07-22 21:27:07,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 129 transitions, 623 flow, removed 23 selfloop flow, removed 8 redundant places. [2022-07-22 21:27:07,438 INFO L242 Difference]: Finished difference. Result has 144 places, 106 transitions, 395 flow [2022-07-22 21:27:07,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=395, PETRI_PLACES=144, PETRI_TRANSITIONS=106} [2022-07-22 21:27:07,439 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 27 predicate places. [2022-07-22 21:27:07,440 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 106 transitions, 395 flow [2022-07-22 21:27:07,440 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-22 21:27:07,440 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:07,440 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-22 21:27:07,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 21:27:07,441 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:27:07,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:07,441 INFO L85 PathProgramCache]: Analyzing trace with hash 289013689, now seen corresponding path program 1 times [2022-07-22 21:27:07,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:07,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318530902] [2022-07-22 21:27:07,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:07,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:07,510 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-22 21:27:07,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:07,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318530902] [2022-07-22 21:27:07,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318530902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:07,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:07,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:27:07,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946108110] [2022-07-22 21:27:07,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:07,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:27:07,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:07,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:27:07,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:27:07,513 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-07-22 21:27:07,514 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 106 transitions, 395 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-22 21:27:07,514 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:07,514 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-07-22 21:27:07,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:07,784 INFO L129 PetriNetUnfolder]: 447/1507 cut-off events. [2022-07-22 21:27:07,785 INFO L130 PetriNetUnfolder]: For 7796/8228 co-relation queries the response was YES. [2022-07-22 21:27:07,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5798 conditions, 1507 events. 447/1507 cut-off events. For 7796/8228 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11839 event pairs, 118 based on Foata normal form. 42/1461 useless extension candidates. Maximal degree in co-relation 5714. Up to 308 conditions per place. [2022-07-22 21:27:07,798 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 39 selfloop transitions, 12 changer transitions 6/138 dead transitions. [2022-07-22 21:27:07,798 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 138 transitions, 784 flow [2022-07-22 21:27:07,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:27:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:27:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 867 transitions. [2022-07-22 21:27:07,801 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8601190476190477 [2022-07-22 21:27:07,801 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 867 transitions. [2022-07-22 21:27:07,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 867 transitions. [2022-07-22 21:27:07,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:07,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 867 transitions. [2022-07-22 21:27:07,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.33333333333333) internal successors, (867), 9 states have internal predecessors, (867), 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-22 21:27:07,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-22 21:27:07,804 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-22 21:27:07,804 INFO L186 Difference]: Start difference. First operand has 144 places, 106 transitions, 395 flow. Second operand 9 states and 867 transitions. [2022-07-22 21:27:07,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 138 transitions, 784 flow [2022-07-22 21:27:07,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 138 transitions, 699 flow, removed 37 selfloop flow, removed 13 redundant places. [2022-07-22 21:27:07,859 INFO L242 Difference]: Finished difference. Result has 140 places, 115 transitions, 502 flow [2022-07-22 21:27:07,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=502, PETRI_PLACES=140, PETRI_TRANSITIONS=115} [2022-07-22 21:27:07,860 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 23 predicate places. [2022-07-22 21:27:07,860 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 115 transitions, 502 flow [2022-07-22 21:27:07,860 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-22 21:27:07,861 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:07,861 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-22 21:27:07,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 21:27:07,861 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:27:07,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:07,862 INFO L85 PathProgramCache]: Analyzing trace with hash 583908315, now seen corresponding path program 1 times [2022-07-22 21:27:07,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:07,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398721384] [2022-07-22 21:27:07,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:07,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:07,971 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-22 21:27:07,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:07,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398721384] [2022-07-22 21:27:07,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398721384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:07,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:07,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 21:27:07,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594972735] [2022-07-22 21:27:07,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:07,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 21:27:07,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:07,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 21:27:07,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-22 21:27:07,973 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-07-22 21:27:07,974 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 115 transitions, 502 flow. Second operand has 10 states, 10 states have (on average 89.6) internal successors, (896), 10 states have internal predecessors, (896), 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-22 21:27:07,974 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:07,974 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-07-22 21:27:07,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:08,318 INFO L129 PetriNetUnfolder]: 628/1870 cut-off events. [2022-07-22 21:27:08,318 INFO L130 PetriNetUnfolder]: For 9306/9528 co-relation queries the response was YES. [2022-07-22 21:27:08,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7243 conditions, 1870 events. 628/1870 cut-off events. For 9306/9528 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 15564 event pairs, 237 based on Foata normal form. 53/1778 useless extension candidates. Maximal degree in co-relation 7160. Up to 548 conditions per place. [2022-07-22 21:27:08,329 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 21 selfloop transitions, 10 changer transitions 41/150 dead transitions. [2022-07-22 21:27:08,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 150 transitions, 946 flow [2022-07-22 21:27:08,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 21:27:08,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-22 21:27:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1194 transitions. [2022-07-22 21:27:08,332 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.820054945054945 [2022-07-22 21:27:08,332 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1194 transitions. [2022-07-22 21:27:08,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1194 transitions. [2022-07-22 21:27:08,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:08,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1194 transitions. [2022-07-22 21:27:08,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.84615384615384) internal successors, (1194), 13 states have internal predecessors, (1194), 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-22 21:27:08,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 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-22 21:27:08,336 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 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-22 21:27:08,336 INFO L186 Difference]: Start difference. First operand has 140 places, 115 transitions, 502 flow. Second operand 13 states and 1194 transitions. [2022-07-22 21:27:08,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 150 transitions, 946 flow [2022-07-22 21:27:08,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 150 transitions, 885 flow, removed 29 selfloop flow, removed 1 redundant places. [2022-07-22 21:27:08,349 INFO L242 Difference]: Finished difference. Result has 158 places, 107 transitions, 434 flow [2022-07-22 21:27:08,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=434, PETRI_PLACES=158, PETRI_TRANSITIONS=107} [2022-07-22 21:27:08,351 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 41 predicate places. [2022-07-22 21:27:08,351 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 107 transitions, 434 flow [2022-07-22 21:27:08,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.6) internal successors, (896), 10 states have internal predecessors, (896), 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-22 21:27:08,351 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:08,352 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-22 21:27:08,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 21:27:08,352 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:27:08,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:08,353 INFO L85 PathProgramCache]: Analyzing trace with hash -290566432, now seen corresponding path program 1 times [2022-07-22 21:27:08,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:08,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661723614] [2022-07-22 21:27:08,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:08,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:08,477 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-22 21:27:08,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:08,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661723614] [2022-07-22 21:27:08,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661723614] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:08,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:08,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 21:27:08,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749457866] [2022-07-22 21:27:08,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:08,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 21:27:08,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:08,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 21:27:08,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-22 21:27:08,482 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-07-22 21:27:08,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 107 transitions, 434 flow. Second operand has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 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-22 21:27:08,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:08,484 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-07-22 21:27:08,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:08,769 INFO L129 PetriNetUnfolder]: 293/1034 cut-off events. [2022-07-22 21:27:08,769 INFO L130 PetriNetUnfolder]: For 8822/8974 co-relation queries the response was YES. [2022-07-22 21:27:08,773 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4588 conditions, 1034 events. 293/1034 cut-off events. For 8822/8974 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7419 event pairs, 125 based on Foata normal form. 41/986 useless extension candidates. Maximal degree in co-relation 4494. Up to 345 conditions per place. [2022-07-22 21:27:08,778 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 25 selfloop transitions, 10 changer transitions 19/132 dead transitions. [2022-07-22 21:27:08,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 132 transitions, 804 flow [2022-07-22 21:27:08,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 21:27:08,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-22 21:27:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1106 transitions. [2022-07-22 21:27:08,781 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8229166666666666 [2022-07-22 21:27:08,781 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1106 transitions. [2022-07-22 21:27:08,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1106 transitions. [2022-07-22 21:27:08,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:08,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1106 transitions. [2022-07-22 21:27:08,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 92.16666666666667) internal successors, (1106), 12 states have internal predecessors, (1106), 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-22 21:27:08,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 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-22 21:27:08,786 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 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-22 21:27:08,786 INFO L186 Difference]: Start difference. First operand has 158 places, 107 transitions, 434 flow. Second operand 12 states and 1106 transitions. [2022-07-22 21:27:08,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 132 transitions, 804 flow [2022-07-22 21:27:08,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 132 transitions, 737 flow, removed 26 selfloop flow, removed 14 redundant places. [2022-07-22 21:27:08,796 INFO L242 Difference]: Finished difference. Result has 150 places, 109 transitions, 466 flow [2022-07-22 21:27:08,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=466, PETRI_PLACES=150, PETRI_TRANSITIONS=109} [2022-07-22 21:27:08,798 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 33 predicate places. [2022-07-22 21:27:08,798 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 109 transitions, 466 flow [2022-07-22 21:27:08,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 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-22 21:27:08,799 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:08,799 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-22 21:27:08,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 21:27:08,799 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:27:08,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:08,800 INFO L85 PathProgramCache]: Analyzing trace with hash -126403070, now seen corresponding path program 2 times [2022-07-22 21:27:08,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:08,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296637620] [2022-07-22 21:27:08,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:08,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:08,954 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-22 21:27:08,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:08,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296637620] [2022-07-22 21:27:08,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296637620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:08,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:08,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 21:27:08,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44966470] [2022-07-22 21:27:08,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:08,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 21:27:08,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:08,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 21:27:08,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-22 21:27:08,957 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-07-22 21:27:08,957 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 109 transitions, 466 flow. Second operand has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 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-22 21:27:08,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:08,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-07-22 21:27:08,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:09,284 INFO L129 PetriNetUnfolder]: 252/970 cut-off events. [2022-07-22 21:27:09,285 INFO L130 PetriNetUnfolder]: For 10591/10756 co-relation queries the response was YES. [2022-07-22 21:27:09,289 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4731 conditions, 970 events. 252/970 cut-off events. For 10591/10756 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7022 event pairs, 79 based on Foata normal form. 49/938 useless extension candidates. Maximal degree in co-relation 4642. Up to 238 conditions per place. [2022-07-22 21:27:09,293 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 24 selfloop transitions, 17 changer transitions 19/139 dead transitions. [2022-07-22 21:27:09,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 139 transitions, 1013 flow [2022-07-22 21:27:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 21:27:09,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-22 21:27:09,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1209 transitions. [2022-07-22 21:27:09,296 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8303571428571429 [2022-07-22 21:27:09,297 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1209 transitions. [2022-07-22 21:27:09,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1209 transitions. [2022-07-22 21:27:09,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:09,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1209 transitions. [2022-07-22 21:27:09,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:27:09,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 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-22 21:27:09,302 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 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-22 21:27:09,302 INFO L186 Difference]: Start difference. First operand has 150 places, 109 transitions, 466 flow. Second operand 13 states and 1209 transitions. [2022-07-22 21:27:09,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 139 transitions, 1013 flow [2022-07-22 21:27:09,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 139 transitions, 892 flow, removed 51 selfloop flow, removed 10 redundant places. [2022-07-22 21:27:09,316 INFO L242 Difference]: Finished difference. Result has 153 places, 113 transitions, 533 flow [2022-07-22 21:27:09,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=533, PETRI_PLACES=153, PETRI_TRANSITIONS=113} [2022-07-22 21:27:09,316 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 36 predicate places. [2022-07-22 21:27:09,316 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 113 transitions, 533 flow [2022-07-22 21:27:09,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 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-22 21:27:09,317 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:09,317 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-22 21:27:09,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 21:27:09,318 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:27:09,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:09,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2121845482, now seen corresponding path program 1 times [2022-07-22 21:27:09,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:09,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131136090] [2022-07-22 21:27:09,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:09,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:09,515 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-22 21:27:09,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:09,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131136090] [2022-07-22 21:27:09,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131136090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:09,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:09,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-22 21:27:09,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692088687] [2022-07-22 21:27:09,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:09,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 21:27:09,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:09,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 21:27:09,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-07-22 21:27:09,518 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 112 [2022-07-22 21:27:09,519 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 113 transitions, 533 flow. Second operand has 14 states, 14 states have (on average 87.42857142857143) internal successors, (1224), 14 states have internal predecessors, (1224), 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-22 21:27:09,520 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:09,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 112 [2022-07-22 21:27:09,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:09,823 INFO L129 PetriNetUnfolder]: 186/776 cut-off events. [2022-07-22 21:27:09,824 INFO L130 PetriNetUnfolder]: For 8614/8806 co-relation queries the response was YES. [2022-07-22 21:27:09,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3838 conditions, 776 events. 186/776 cut-off events. For 8614/8806 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5140 event pairs, 81 based on Foata normal form. 21/724 useless extension candidates. Maximal degree in co-relation 3744. Up to 264 conditions per place. [2022-07-22 21:27:09,832 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 31 selfloop transitions, 13 changer transitions 10/130 dead transitions. [2022-07-22 21:27:09,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 130 transitions, 897 flow [2022-07-22 21:27:09,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 21:27:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-22 21:27:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1332 transitions. [2022-07-22 21:27:09,835 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7928571428571428 [2022-07-22 21:27:09,835 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1332 transitions. [2022-07-22 21:27:09,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1332 transitions. [2022-07-22 21:27:09,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:09,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1332 transitions. [2022-07-22 21:27:09,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 88.8) internal successors, (1332), 15 states have internal predecessors, (1332), 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-22 21:27:09,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 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-22 21:27:09,840 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 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-22 21:27:09,840 INFO L186 Difference]: Start difference. First operand has 153 places, 113 transitions, 533 flow. Second operand 15 states and 1332 transitions. [2022-07-22 21:27:09,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 130 transitions, 897 flow [2022-07-22 21:27:09,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 130 transitions, 824 flow, removed 35 selfloop flow, removed 8 redundant places. [2022-07-22 21:27:09,851 INFO L242 Difference]: Finished difference. Result has 160 places, 115 transitions, 601 flow [2022-07-22 21:27:09,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=601, PETRI_PLACES=160, PETRI_TRANSITIONS=115} [2022-07-22 21:27:09,852 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 43 predicate places. [2022-07-22 21:27:09,852 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 115 transitions, 601 flow [2022-07-22 21:27:09,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 87.42857142857143) internal successors, (1224), 14 states have internal predecessors, (1224), 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-22 21:27:09,853 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:09,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, 1, 1, 1, 1] [2022-07-22 21:27:09,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 21:27:09,853 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:27:09,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:09,853 INFO L85 PathProgramCache]: Analyzing trace with hash 278766544, now seen corresponding path program 2 times [2022-07-22 21:27:09,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:09,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042560435] [2022-07-22 21:27:09,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:09,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:10,021 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-22 21:27:10,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:10,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042560435] [2022-07-22 21:27:10,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042560435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:10,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:10,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 21:27:10,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051267221] [2022-07-22 21:27:10,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:10,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 21:27:10,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:10,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 21:27:10,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-22 21:27:10,023 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 112 [2022-07-22 21:27:10,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 115 transitions, 601 flow. Second operand has 12 states, 12 states have (on average 87.66666666666667) internal successors, (1052), 12 states have internal predecessors, (1052), 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-22 21:27:10,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:10,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 112 [2022-07-22 21:27:10,025 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:10,299 INFO L129 PetriNetUnfolder]: 144/740 cut-off events. [2022-07-22 21:27:10,300 INFO L130 PetriNetUnfolder]: For 6989/7433 co-relation queries the response was YES. [2022-07-22 21:27:10,303 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3351 conditions, 740 events. 144/740 cut-off events. For 6989/7433 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5226 event pairs, 57 based on Foata normal form. 24/702 useless extension candidates. Maximal degree in co-relation 3252. Up to 128 conditions per place. [2022-07-22 21:27:10,305 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 34 selfloop transitions, 12 changer transitions 10/132 dead transitions. [2022-07-22 21:27:10,305 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 132 transitions, 960 flow [2022-07-22 21:27:10,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 21:27:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-22 21:27:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1161 transitions. [2022-07-22 21:27:10,307 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7973901098901099 [2022-07-22 21:27:10,307 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1161 transitions. [2022-07-22 21:27:10,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1161 transitions. [2022-07-22 21:27:10,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:10,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1161 transitions. [2022-07-22 21:27:10,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 89.3076923076923) internal successors, (1161), 13 states have internal predecessors, (1161), 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-22 21:27:10,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 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-22 21:27:10,311 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 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-22 21:27:10,311 INFO L186 Difference]: Start difference. First operand has 160 places, 115 transitions, 601 flow. Second operand 13 states and 1161 transitions. [2022-07-22 21:27:10,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 132 transitions, 960 flow [2022-07-22 21:27:10,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 132 transitions, 850 flow, removed 45 selfloop flow, removed 13 redundant places. [2022-07-22 21:27:10,323 INFO L242 Difference]: Finished difference. Result has 160 places, 115 transitions, 586 flow [2022-07-22 21:27:10,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=586, PETRI_PLACES=160, PETRI_TRANSITIONS=115} [2022-07-22 21:27:10,324 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 43 predicate places. [2022-07-22 21:27:10,324 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 115 transitions, 586 flow [2022-07-22 21:27:10,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.66666666666667) internal successors, (1052), 12 states have internal predecessors, (1052), 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-22 21:27:10,325 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:10,325 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-22 21:27:10,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 21:27:10,326 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:27:10,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:10,326 INFO L85 PathProgramCache]: Analyzing trace with hash -721839056, now seen corresponding path program 1 times [2022-07-22 21:27:10,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:10,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108814369] [2022-07-22 21:27:10,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:10,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:10,385 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-22 21:27:10,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:10,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108814369] [2022-07-22 21:27:10,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108814369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:10,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:10,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:27:10,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945862576] [2022-07-22 21:27:10,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:10,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:27:10,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:10,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:27:10,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:27:10,387 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-07-22 21:27:10,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 115 transitions, 586 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-22 21:27:10,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:10,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-07-22 21:27:10,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:11,081 INFO L129 PetriNetUnfolder]: 2841/5560 cut-off events. [2022-07-22 21:27:11,095 INFO L130 PetriNetUnfolder]: For 35826/36324 co-relation queries the response was YES. [2022-07-22 21:27:11,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20531 conditions, 5560 events. 2841/5560 cut-off events. For 35826/36324 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 45212 event pairs, 113 based on Foata normal form. 351/5559 useless extension candidates. Maximal degree in co-relation 20439. Up to 1913 conditions per place. [2022-07-22 21:27:11,141 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 44 selfloop transitions, 6 changer transitions 100/231 dead transitions. [2022-07-22 21:27:11,145 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 231 transitions, 2123 flow [2022-07-22 21:27:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:27:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:27:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 964 transitions. [2022-07-22 21:27:11,147 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8607142857142858 [2022-07-22 21:27:11,147 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 964 transitions. [2022-07-22 21:27:11,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 964 transitions. [2022-07-22 21:27:11,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:11,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 964 transitions. [2022-07-22 21:27:11,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.4) internal successors, (964), 10 states have internal predecessors, (964), 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-22 21:27:11,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:27:11,150 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:27:11,151 INFO L186 Difference]: Start difference. First operand has 160 places, 115 transitions, 586 flow. Second operand 10 states and 964 transitions. [2022-07-22 21:27:11,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 231 transitions, 2123 flow [2022-07-22 21:27:11,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 231 transitions, 1958 flow, removed 67 selfloop flow, removed 13 redundant places. [2022-07-22 21:27:11,182 INFO L242 Difference]: Finished difference. Result has 156 places, 113 transitions, 555 flow [2022-07-22 21:27:11,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=555, PETRI_PLACES=156, PETRI_TRANSITIONS=113} [2022-07-22 21:27:11,183 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 39 predicate places. [2022-07-22 21:27:11,183 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 113 transitions, 555 flow [2022-07-22 21:27:11,184 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-22 21:27:11,184 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:11,184 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-22 21:27:11,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 21:27:11,184 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:27:11,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:11,185 INFO L85 PathProgramCache]: Analyzing trace with hash -607762605, now seen corresponding path program 1 times [2022-07-22 21:27:11,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:11,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88963048] [2022-07-22 21:27:11,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:11,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:11,317 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-22 21:27:11,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:11,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88963048] [2022-07-22 21:27:11,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88963048] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:11,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:11,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:27:11,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867164091] [2022-07-22 21:27:11,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:11,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:27:11,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:11,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:27:11,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:27:11,320 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-07-22 21:27:11,320 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 113 transitions, 555 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-22 21:27:11,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:11,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-07-22 21:27:11,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:11,755 INFO L129 PetriNetUnfolder]: 1096/2658 cut-off events. [2022-07-22 21:27:11,755 INFO L130 PetriNetUnfolder]: For 14665/14896 co-relation queries the response was YES. [2022-07-22 21:27:11,767 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11634 conditions, 2658 events. 1096/2658 cut-off events. For 14665/14896 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 21552 event pairs, 11 based on Foata normal form. 254/2850 useless extension candidates. Maximal degree in co-relation 11546. Up to 919 conditions per place. [2022-07-22 21:27:11,771 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 40 selfloop transitions, 9 changer transitions 65/194 dead transitions. [2022-07-22 21:27:11,771 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 194 transitions, 1687 flow [2022-07-22 21:27:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:27:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:27:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 962 transitions. [2022-07-22 21:27:11,773 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8589285714285714 [2022-07-22 21:27:11,773 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 962 transitions. [2022-07-22 21:27:11,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 962 transitions. [2022-07-22 21:27:11,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:11,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 962 transitions. [2022-07-22 21:27:11,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.2) internal successors, (962), 10 states have internal predecessors, (962), 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-22 21:27:11,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:27:11,776 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:27:11,776 INFO L186 Difference]: Start difference. First operand has 156 places, 113 transitions, 555 flow. Second operand 10 states and 962 transitions. [2022-07-22 21:27:11,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 194 transitions, 1687 flow [2022-07-22 21:27:11,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 194 transitions, 1553 flow, removed 40 selfloop flow, removed 9 redundant places. [2022-07-22 21:27:11,798 INFO L242 Difference]: Finished difference. Result has 156 places, 113 transitions, 572 flow [2022-07-22 21:27:11,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=572, PETRI_PLACES=156, PETRI_TRANSITIONS=113} [2022-07-22 21:27:11,799 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 39 predicate places. [2022-07-22 21:27:11,799 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 113 transitions, 572 flow [2022-07-22 21:27:11,799 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-22 21:27:11,799 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:11,799 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] [2022-07-22 21:27:11,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 21:27:11,800 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:27:11,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:11,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1048140746, now seen corresponding path program 1 times [2022-07-22 21:27:11,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:11,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229073853] [2022-07-22 21:27:11,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:11,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:27:11,865 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-22 21:27:11,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:27:11,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229073853] [2022-07-22 21:27:11,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229073853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:27:11,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:27:11,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:27:11,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686813424] [2022-07-22 21:27:11,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:27:11,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:27:11,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:27:11,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:27:11,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:27:11,868 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-07-22 21:27:11,868 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 113 transitions, 572 flow. Second operand has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 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-22 21:27:11,868 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:27:11,868 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-07-22 21:27:11,868 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:27:12,131 INFO L129 PetriNetUnfolder]: 315/1118 cut-off events. [2022-07-22 21:27:12,132 INFO L130 PetriNetUnfolder]: For 6234/6336 co-relation queries the response was YES. [2022-07-22 21:27:12,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4917 conditions, 1118 events. 315/1118 cut-off events. For 6234/6336 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8491 event pairs, 2 based on Foata normal form. 92/1184 useless extension candidates. Maximal degree in co-relation 4828. Up to 334 conditions per place. [2022-07-22 21:27:12,137 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 20 selfloop transitions, 12 changer transitions 50/156 dead transitions. [2022-07-22 21:27:12,137 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 156 transitions, 1189 flow [2022-07-22 21:27:12,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 21:27:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-22 21:27:12,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1033 transitions. [2022-07-22 21:27:12,139 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.838474025974026 [2022-07-22 21:27:12,139 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1033 transitions. [2022-07-22 21:27:12,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1033 transitions. [2022-07-22 21:27:12,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:27:12,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1033 transitions. [2022-07-22 21:27:12,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.9090909090909) internal successors, (1033), 11 states have internal predecessors, (1033), 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-22 21:27:12,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 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-22 21:27:12,142 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 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-22 21:27:12,142 INFO L186 Difference]: Start difference. First operand has 156 places, 113 transitions, 572 flow. Second operand 11 states and 1033 transitions. [2022-07-22 21:27:12,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 156 transitions, 1189 flow [2022-07-22 21:27:12,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 156 transitions, 954 flow, removed 97 selfloop flow, removed 17 redundant places. [2022-07-22 21:27:12,156 INFO L242 Difference]: Finished difference. Result has 151 places, 100 transitions, 394 flow [2022-07-22 21:27:12,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=394, PETRI_PLACES=151, PETRI_TRANSITIONS=100} [2022-07-22 21:27:12,157 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 34 predicate places. [2022-07-22 21:27:12,157 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 100 transitions, 394 flow [2022-07-22 21:27:12,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 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-22 21:27:12,157 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:27:12,158 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] [2022-07-22 21:27:12,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 21:27:12,158 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:27:12,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:27:12,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1355815032, now seen corresponding path program 1 times [2022-07-22 21:27:12,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:27:12,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917462729] [2022-07-22 21:27:12,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:27:12,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:27:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:27:12,204 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 21:27:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:27:12,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 21:27:12,271 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 21:27:12,272 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-22 21:27:12,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-22 21:27:12,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-22 21:27:12,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-22 21:27:12,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-22 21:27:12,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-22 21:27:12,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 21:27:12,274 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:27:12,279 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-22 21:27:12,279 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 21:27:12,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 09:27:12 BasicIcfg [2022-07-22 21:27:12,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 21:27:12,344 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 21:27:12,344 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 21:27:12,344 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 21:27:12,344 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:27:03" (3/4) ... [2022-07-22 21:27:12,346 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 21:27:12,430 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 21:27:12,431 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 21:27:12,431 INFO L158 Benchmark]: Toolchain (without parser) took 10376.83ms. Allocated memory was 90.2MB in the beginning and 509.6MB in the end (delta: 419.4MB). Free memory was 53.0MB in the beginning and 324.9MB in the end (delta: -271.9MB). Peak memory consumption was 147.4MB. Max. memory is 16.1GB. [2022-07-22 21:27:12,431 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 90.2MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 21:27:12,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.02ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 52.8MB in the beginning and 70.2MB in the end (delta: -17.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 21:27:12,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.36ms. Allocated memory is still 109.1MB. Free memory was 70.2MB in the beginning and 67.0MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 21:27:12,432 INFO L158 Benchmark]: Boogie Preprocessor took 21.47ms. Allocated memory is still 109.1MB. Free memory was 67.0MB in the beginning and 64.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 21:27:12,432 INFO L158 Benchmark]: RCFGBuilder took 764.10ms. Allocated memory is still 109.1MB. Free memory was 64.9MB in the beginning and 76.9MB in the end (delta: -12.1MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2022-07-22 21:27:12,433 INFO L158 Benchmark]: TraceAbstraction took 8984.04ms. Allocated memory was 109.1MB in the beginning and 509.6MB in the end (delta: 400.6MB). Free memory was 76.3MB in the beginning and 349.0MB in the end (delta: -272.7MB). Peak memory consumption was 129.9MB. Max. memory is 16.1GB. [2022-07-22 21:27:12,433 INFO L158 Benchmark]: Witness Printer took 86.91ms. Allocated memory is still 509.6MB. Free memory was 348.0MB in the beginning and 324.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-22 21:27:12,434 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.20ms. Allocated memory is still 90.2MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.02ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 52.8MB in the beginning and 70.2MB in the end (delta: -17.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.36ms. Allocated memory is still 109.1MB. Free memory was 70.2MB in the beginning and 67.0MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.47ms. Allocated memory is still 109.1MB. Free memory was 67.0MB in the beginning and 64.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 764.10ms. Allocated memory is still 109.1MB. Free memory was 64.9MB in the beginning and 76.9MB in the end (delta: -12.1MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8984.04ms. Allocated memory was 109.1MB in the beginning and 509.6MB in the end (delta: 400.6MB). Free memory was 76.3MB in the beginning and 349.0MB in the end (delta: -272.7MB). Peak memory consumption was 129.9MB. Max. memory is 16.1GB. * Witness Printer took 86.91ms. Allocated memory is still 509.6MB. Free memory was 348.0MB in the beginning and 324.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. 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] [L716] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L717] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L718] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L719] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L720] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L721] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L726] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L727] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L728] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L729] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L730] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L731] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t2492; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2493; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2494; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 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, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$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, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L844] 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=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [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=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 812]: 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: 816]: 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: 814]: 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, 138 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: 8.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 678 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 678 mSDsluCounter, 702 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1069 mSDsCounter, 193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1861 IncrementalHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 193 mSolverCounterUnsat, 142 mSDtfsCounter, 1861 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=601occurred in iteration=12, InterpolantAutomatonStates: 173, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1312 NumberOfCodeBlocks, 1312 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1210 ConstructedInterpolants, 0 QuantifiedInterpolants, 6249 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-22 21:27:12,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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