./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.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/mix019_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 21:21:49,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:21:49,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:21:49,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:21:49,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:21:49,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:21:49,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:21:49,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:21:49,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:21:49,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:21:49,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:21:49,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:21:49,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:21:49,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:21:49,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:21:49,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:21:49,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:21:49,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:21:49,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:21:49,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:21:49,305 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:21:49,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:21:49,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:21:49,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:21:49,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:21:49,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:21:49,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:21:49,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:21:49,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:21:49,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:21:49,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:21:49,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:21:49,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:21:49,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:21:49,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:21:49,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:21:49,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:21:49,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:21:49,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:21:49,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:21:49,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:21:49,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:21:49,325 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:21:49,352 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:21:49,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:21:49,353 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:21:49,353 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:21:49,354 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:21:49,354 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:21:49,354 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:21:49,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:21:49,354 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:21:49,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:21:49,355 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:21:49,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:21:49,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:21:49,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:21:49,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:21:49,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:21:49,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:21:49,356 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:21:49,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:21:49,357 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:21:49,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:21:49,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:21:49,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:21:49,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:21:49,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:21:49,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:21:49,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:21:49,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:21:49,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:21:49,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:21:49,358 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:21:49,359 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:21:49,359 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:21:49,359 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 -> 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 [2022-07-22 21:21:49,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:21:49,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:21:49,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:21:49,643 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:21:49,643 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:21:49,644 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-07-22 21:21:49,694 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef5e9cb99/8c4d94774c0d4cafb80b83a50911316f/FLAG969a4357f [2022-07-22 21:21:50,142 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:21:50,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-07-22 21:21:50,158 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef5e9cb99/8c4d94774c0d4cafb80b83a50911316f/FLAG969a4357f [2022-07-22 21:21:50,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef5e9cb99/8c4d94774c0d4cafb80b83a50911316f [2022-07-22 21:21:50,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:21:50,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:21:50,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:21:50,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:21:50,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:21:50,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:21:50" (1/1) ... [2022-07-22 21:21:50,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b5c3f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:50, skipping insertion in model container [2022-07-22 21:21:50,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:21:50" (1/1) ... [2022-07-22 21:21:50,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:21:50,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:21:50,673 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/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-07-22 21:21:50,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:21:50,871 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:21:50,896 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/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-07-22 21:21:50,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:21:50,973 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:21:50,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:50 WrapperNode [2022-07-22 21:21:50,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:21:50,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:21:50,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:21:50,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:21:50,982 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:21:50" (1/1) ... [2022-07-22 21:21:51,013 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:21:50" (1/1) ... [2022-07-22 21:21:51,043 INFO L137 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2022-07-22 21:21:51,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:21:51,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:21:51,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:21:51,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:21:51,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:50" (1/1) ... [2022-07-22 21:21:51,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:50" (1/1) ... [2022-07-22 21:21:51,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:50" (1/1) ... [2022-07-22 21:21:51,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:50" (1/1) ... [2022-07-22 21:21:51,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:50" (1/1) ... [2022-07-22 21:21:51,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:50" (1/1) ... [2022-07-22 21:21:51,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:50" (1/1) ... [2022-07-22 21:21:51,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:21:51,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:21:51,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:21:51,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:21:51,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:50" (1/1) ... [2022-07-22 21:21:51,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:21:51,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:21:51,137 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:21:51,161 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:21:51,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:21:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 21:21:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:21:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:21:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:21:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-22 21:21:51,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-22 21:21:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-22 21:21:51,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-22 21:21:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-22 21:21:51,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-22 21:21:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:21:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 21:21:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:21:51,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:21:51,186 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:21:51,332 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:21:51,334 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:21:51,779 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:21:52,115 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:21:52,115 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 21:21:52,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:21:52 BoogieIcfgContainer [2022-07-22 21:21:52,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:21:52,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:21:52,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:21:52,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:21:52,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:21:50" (1/3) ... [2022-07-22 21:21:52,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527fd58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:21:52, skipping insertion in model container [2022-07-22 21:21:52,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:21:50" (2/3) ... [2022-07-22 21:21:52,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527fd58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:21:52, skipping insertion in model container [2022-07-22 21:21:52,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:21:52" (3/3) ... [2022-07-22 21:21:52,126 INFO L111 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-07-22 21:21:52,143 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:21:52,151 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:21:52,151 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-22 21:21:52,151 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:21:52,230 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-22 21:21:52,281 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-07-22 21:21:52,340 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2022-07-22 21:21:52,340 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:21:52,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-07-22 21:21:52,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-07-22 21:21:52,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-07-22 21:21:52,365 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:21:52,373 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@5d1d0473, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@489eb3be [2022-07-22 21:21:52,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-22 21:21:52,384 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2022-07-22 21:21:52,385 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:21:52,385 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:52,385 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] [2022-07-22 21:21:52,386 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:21:52,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:52,391 INFO L85 PathProgramCache]: Analyzing trace with hash -438048260, now seen corresponding path program 1 times [2022-07-22 21:21:52,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:52,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325011656] [2022-07-22 21:21:52,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:52,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:52,696 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:21:52,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:52,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325011656] [2022-07-22 21:21:52,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325011656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:52,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:52,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 21:21:52,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577527125] [2022-07-22 21:21:52,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:52,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:21:52,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:52,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:21:52,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:21:52,741 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 117 [2022-07-22 21:21:52,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:21:52,746 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:52,746 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 117 [2022-07-22 21:21:52,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:52,978 INFO L129 PetriNetUnfolder]: 58/278 cut-off events. [2022-07-22 21:21:52,978 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-07-22 21:21:52,980 INFO L84 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 278 events. 58/278 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1112 event pairs, 10 based on Foata normal form. 20/280 useless extension candidates. Maximal degree in co-relation 354. Up to 79 conditions per place. [2022-07-22 21:21:52,984 INFO L132 encePairwiseOnDemand]: 112/117 looper letters, 14 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2022-07-22 21:21:52,984 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 116 transitions, 279 flow [2022-07-22 21:21:52,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:21:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:21:53,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-07-22 21:21:53,007 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9401709401709402 [2022-07-22 21:21:53,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2022-07-22 21:21:53,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2022-07-22 21:21:53,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:53,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2022-07-22 21:21:53,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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:21:53,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 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:21:53,027 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 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:21:53,029 INFO L186 Difference]: Start difference. First operand has 122 places, 114 transitions, 237 flow. Second operand 3 states and 330 transitions. [2022-07-22 21:21:53,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 116 transitions, 279 flow [2022-07-22 21:21:53,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 274 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-22 21:21:53,036 INFO L242 Difference]: Finished difference. Result has 119 places, 110 transitions, 230 flow [2022-07-22 21:21:53,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2022-07-22 21:21:53,045 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -3 predicate places. [2022-07-22 21:21:53,045 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 230 flow [2022-07-22 21:21:53,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:21:53,046 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:53,046 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:21:53,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:21:53,047 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:21:53,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:53,048 INFO L85 PathProgramCache]: Analyzing trace with hash 975051986, now seen corresponding path program 1 times [2022-07-22 21:21:53,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:53,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307476326] [2022-07-22 21:21:53,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:53,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:53,305 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:21:53,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:53,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307476326] [2022-07-22 21:21:53,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307476326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:53,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:53,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:21:53,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780549925] [2022-07-22 21:21:53,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:53,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:21:53,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:53,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:21:53,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:21:53,310 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2022-07-22 21:21:53,311 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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:21:53,311 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:53,311 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2022-07-22 21:21:53,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:54,469 INFO L129 PetriNetUnfolder]: 2098/5350 cut-off events. [2022-07-22 21:21:54,469 INFO L130 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2022-07-22 21:21:54,482 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8756 conditions, 5350 events. 2098/5350 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 46355 event pairs, 284 based on Foata normal form. 0/5206 useless extension candidates. Maximal degree in co-relation 8700. Up to 1266 conditions per place. [2022-07-22 21:21:54,495 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 35 selfloop transitions, 6 changer transitions 90/206 dead transitions. [2022-07-22 21:21:54,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 206 transitions, 676 flow [2022-07-22 21:21:54,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 21:21:54,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-22 21:21:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1280 transitions. [2022-07-22 21:21:54,500 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.84155161078238 [2022-07-22 21:21:54,500 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1280 transitions. [2022-07-22 21:21:54,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1280 transitions. [2022-07-22 21:21:54,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:54,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1280 transitions. [2022-07-22 21:21:54,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.46153846153847) internal successors, (1280), 13 states have internal predecessors, (1280), 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:21:54,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 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:21:54,509 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 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:21:54,509 INFO L186 Difference]: Start difference. First operand has 119 places, 110 transitions, 230 flow. Second operand 13 states and 1280 transitions. [2022-07-22 21:21:54,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 206 transitions, 676 flow [2022-07-22 21:21:54,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 206 transitions, 658 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:21:54,514 INFO L242 Difference]: Finished difference. Result has 141 places, 102 transitions, 288 flow [2022-07-22 21:21:54,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=288, PETRI_PLACES=141, PETRI_TRANSITIONS=102} [2022-07-22 21:21:54,515 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 19 predicate places. [2022-07-22 21:21:54,515 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 102 transitions, 288 flow [2022-07-22 21:21:54,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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:21:54,516 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:54,516 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:21:54,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:21:54,516 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:21:54,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1032499181, now seen corresponding path program 1 times [2022-07-22 21:21:54,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:54,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579353024] [2022-07-22 21:21:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:54,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:54,724 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:21:54,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:54,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579353024] [2022-07-22 21:21:54,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579353024] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:54,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:54,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:21:54,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619085863] [2022-07-22 21:21:54,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:54,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:21:54,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:54,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:21:54,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:21:54,728 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2022-07-22 21:21:54,729 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 102 transitions, 288 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:21:54,729 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:54,729 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2022-07-22 21:21:54,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:55,682 INFO L129 PetriNetUnfolder]: 1450/3007 cut-off events. [2022-07-22 21:21:55,682 INFO L130 PetriNetUnfolder]: For 5265/5265 co-relation queries the response was YES. [2022-07-22 21:21:55,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8772 conditions, 3007 events. 1450/3007 cut-off events. For 5265/5265 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 20509 event pairs, 260 based on Foata normal form. 70/2982 useless extension candidates. Maximal degree in co-relation 8704. Up to 1045 conditions per place. [2022-07-22 21:21:55,710 INFO L132 encePairwiseOnDemand]: 105/117 looper letters, 35 selfloop transitions, 14 changer transitions 67/191 dead transitions. [2022-07-22 21:21:55,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 191 transitions, 994 flow [2022-07-22 21:21:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 21:21:55,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-22 21:21:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1272 transitions. [2022-07-22 21:21:55,715 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8362919132149902 [2022-07-22 21:21:55,715 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1272 transitions. [2022-07-22 21:21:55,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1272 transitions. [2022-07-22 21:21:55,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:55,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1272 transitions. [2022-07-22 21:21:55,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.84615384615384) internal successors, (1272), 13 states have internal predecessors, (1272), 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:21:55,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 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:21:55,724 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 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:21:55,725 INFO L186 Difference]: Start difference. First operand has 141 places, 102 transitions, 288 flow. Second operand 13 states and 1272 transitions. [2022-07-22 21:21:55,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 191 transitions, 994 flow [2022-07-22 21:21:55,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 191 transitions, 942 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-07-22 21:21:55,756 INFO L242 Difference]: Finished difference. Result has 139 places, 108 transitions, 395 flow [2022-07-22 21:21:55,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=395, PETRI_PLACES=139, PETRI_TRANSITIONS=108} [2022-07-22 21:21:55,759 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 17 predicate places. [2022-07-22 21:21:55,759 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 108 transitions, 395 flow [2022-07-22 21:21:55,759 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:21:55,760 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:55,760 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:21:55,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 21:21:55,761 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:21:55,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:55,762 INFO L85 PathProgramCache]: Analyzing trace with hash -58664380, now seen corresponding path program 1 times [2022-07-22 21:21:55,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:55,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457148929] [2022-07-22 21:21:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:55,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:55,913 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:21:55,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:55,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457148929] [2022-07-22 21:21:55,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457148929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:55,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:55,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:21:55,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311516975] [2022-07-22 21:21:55,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:55,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:21:55,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:55,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:21:55,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:21:55,916 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-07-22 21:21:55,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 108 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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:21:55,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:55,917 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-07-22 21:21:55,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:56,954 INFO L129 PetriNetUnfolder]: 2514/5178 cut-off events. [2022-07-22 21:21:56,954 INFO L130 PetriNetUnfolder]: For 5453/6280 co-relation queries the response was YES. [2022-07-22 21:21:56,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12112 conditions, 5178 events. 2514/5178 cut-off events. For 5453/6280 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 41254 event pairs, 239 based on Foata normal form. 3/4902 useless extension candidates. Maximal degree in co-relation 12035. Up to 1278 conditions per place. [2022-07-22 21:21:57,012 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 78 selfloop transitions, 17 changer transitions 0/182 dead transitions. [2022-07-22 21:21:57,013 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 182 transitions, 842 flow [2022-07-22 21:21:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:21:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:21:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1019 transitions. [2022-07-22 21:21:57,016 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.870940170940171 [2022-07-22 21:21:57,016 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1019 transitions. [2022-07-22 21:21:57,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1019 transitions. [2022-07-22 21:21:57,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:57,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1019 transitions. [2022-07-22 21:21:57,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.9) internal successors, (1019), 10 states have internal predecessors, (1019), 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:21:57,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 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:21:57,026 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 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:21:57,027 INFO L186 Difference]: Start difference. First operand has 139 places, 108 transitions, 395 flow. Second operand 10 states and 1019 transitions. [2022-07-22 21:21:57,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 182 transitions, 842 flow [2022-07-22 21:21:57,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 182 transitions, 812 flow, removed 15 selfloop flow, removed 12 redundant places. [2022-07-22 21:21:57,040 INFO L242 Difference]: Finished difference. Result has 133 places, 123 transitions, 485 flow [2022-07-22 21:21:57,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=485, PETRI_PLACES=133, PETRI_TRANSITIONS=123} [2022-07-22 21:21:57,041 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 11 predicate places. [2022-07-22 21:21:57,041 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 123 transitions, 485 flow [2022-07-22 21:21:57,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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:21:57,041 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:57,042 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:21:57,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:21:57,042 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:21:57,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1723580874, now seen corresponding path program 1 times [2022-07-22 21:21:57,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:57,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256471306] [2022-07-22 21:21:57,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:57,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:57,224 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:21:57,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:57,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256471306] [2022-07-22 21:21:57,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256471306] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:57,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:57,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:21:57,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391320750] [2022-07-22 21:21:57,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:57,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:21:57,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:57,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:21:57,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:21:57,230 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2022-07-22 21:21:57,232 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 123 transitions, 485 flow. Second operand has 7 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 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:21:57,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:57,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2022-07-22 21:21:57,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:57,947 INFO L129 PetriNetUnfolder]: 1080/3330 cut-off events. [2022-07-22 21:21:57,947 INFO L130 PetriNetUnfolder]: For 4674/4980 co-relation queries the response was YES. [2022-07-22 21:21:57,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9098 conditions, 3330 events. 1080/3330 cut-off events. For 4674/4980 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 30474 event pairs, 315 based on Foata normal form. 84/3219 useless extension candidates. Maximal degree in co-relation 9021. Up to 631 conditions per place. [2022-07-22 21:21:57,982 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 58 selfloop transitions, 20 changer transitions 12/180 dead transitions. [2022-07-22 21:21:57,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 180 transitions, 982 flow [2022-07-22 21:21:57,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:21:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:21:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 974 transitions. [2022-07-22 21:21:57,984 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8324786324786325 [2022-07-22 21:21:57,985 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 974 transitions. [2022-07-22 21:21:57,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 974 transitions. [2022-07-22 21:21:57,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:57,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 974 transitions. [2022-07-22 21:21:57,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.4) internal successors, (974), 10 states have internal predecessors, (974), 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:21:57,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 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:21:57,990 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 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:21:57,990 INFO L186 Difference]: Start difference. First operand has 133 places, 123 transitions, 485 flow. Second operand 10 states and 974 transitions. [2022-07-22 21:21:57,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 180 transitions, 982 flow [2022-07-22 21:21:58,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 180 transitions, 980 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-22 21:21:58,005 INFO L242 Difference]: Finished difference. Result has 149 places, 133 transitions, 650 flow [2022-07-22 21:21:58,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=650, PETRI_PLACES=149, PETRI_TRANSITIONS=133} [2022-07-22 21:21:58,006 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 27 predicate places. [2022-07-22 21:21:58,006 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 133 transitions, 650 flow [2022-07-22 21:21:58,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 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:21:58,006 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:58,006 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:21:58,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 21:21:58,007 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:21:58,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:58,007 INFO L85 PathProgramCache]: Analyzing trace with hash 2015609334, now seen corresponding path program 1 times [2022-07-22 21:21:58,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:58,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750824988] [2022-07-22 21:21:58,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:58,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:58,140 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:21:58,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:58,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750824988] [2022-07-22 21:21:58,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750824988] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:58,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:58,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:21:58,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377315743] [2022-07-22 21:21:58,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:58,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:21:58,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:58,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:21:58,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:21:58,144 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 117 [2022-07-22 21:21:58,145 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 133 transitions, 650 flow. Second operand has 7 states, 7 states have (on average 89.85714285714286) internal successors, (629), 7 states have internal predecessors, (629), 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:21:58,145 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:58,145 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 117 [2022-07-22 21:21:58,145 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:59,260 INFO L129 PetriNetUnfolder]: 1843/5697 cut-off events. [2022-07-22 21:21:59,260 INFO L130 PetriNetUnfolder]: For 11105/11647 co-relation queries the response was YES. [2022-07-22 21:21:59,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16370 conditions, 5697 events. 1843/5697 cut-off events. For 11105/11647 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 59035 event pairs, 321 based on Foata normal form. 127/5530 useless extension candidates. Maximal degree in co-relation 16280. Up to 1088 conditions per place. [2022-07-22 21:21:59,325 INFO L132 encePairwiseOnDemand]: 104/117 looper letters, 72 selfloop transitions, 34 changer transitions 20/214 dead transitions. [2022-07-22 21:21:59,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 214 transitions, 1379 flow [2022-07-22 21:21:59,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 21:21:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-22 21:21:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1053 transitions. [2022-07-22 21:21:59,329 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2022-07-22 21:21:59,329 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1053 transitions. [2022-07-22 21:21:59,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1053 transitions. [2022-07-22 21:21:59,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:59,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1053 transitions. [2022-07-22 21:21:59,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.72727272727273) internal successors, (1053), 11 states have internal predecessors, (1053), 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:21:59,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 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:21:59,336 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 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:21:59,336 INFO L186 Difference]: Start difference. First operand has 149 places, 133 transitions, 650 flow. Second operand 11 states and 1053 transitions. [2022-07-22 21:21:59,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 214 transitions, 1379 flow [2022-07-22 21:21:59,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 214 transitions, 1349 flow, removed 15 selfloop flow, removed 0 redundant places. [2022-07-22 21:21:59,385 INFO L242 Difference]: Finished difference. Result has 168 places, 156 transitions, 1014 flow [2022-07-22 21:21:59,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1014, PETRI_PLACES=168, PETRI_TRANSITIONS=156} [2022-07-22 21:21:59,387 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 46 predicate places. [2022-07-22 21:21:59,387 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 156 transitions, 1014 flow [2022-07-22 21:21:59,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.85714285714286) internal successors, (629), 7 states have internal predecessors, (629), 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:21:59,387 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:59,387 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:21:59,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 21:21:59,388 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:21:59,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1136664540, now seen corresponding path program 2 times [2022-07-22 21:21:59,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:59,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476872727] [2022-07-22 21:21:59,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:59,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:59,544 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:21:59,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:59,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476872727] [2022-07-22 21:21:59,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476872727] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:59,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:59,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:21:59,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522894013] [2022-07-22 21:21:59,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:59,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:21:59,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:59,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:21:59,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:21:59,553 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-07-22 21:21:59,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 156 transitions, 1014 flow. Second operand has 7 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 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:21:59,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:59,554 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-07-22 21:21:59,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:22:01,116 INFO L129 PetriNetUnfolder]: 4628/9594 cut-off events. [2022-07-22 21:22:01,116 INFO L130 PetriNetUnfolder]: For 25992/29519 co-relation queries the response was YES. [2022-07-22 21:22:01,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30541 conditions, 9594 events. 4628/9594 cut-off events. For 25992/29519 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 87727 event pairs, 240 based on Foata normal form. 344/9648 useless extension candidates. Maximal degree in co-relation 30441. Up to 1627 conditions per place. [2022-07-22 21:22:01,176 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 75 selfloop transitions, 32 changer transitions 59/264 dead transitions. [2022-07-22 21:22:01,176 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 264 transitions, 2016 flow [2022-07-22 21:22:01,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 21:22:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-22 21:22:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1328 transitions. [2022-07-22 21:22:01,180 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8731097961867192 [2022-07-22 21:22:01,180 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1328 transitions. [2022-07-22 21:22:01,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1328 transitions. [2022-07-22 21:22:01,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:22:01,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1328 transitions. [2022-07-22 21:22:01,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.15384615384616) internal successors, (1328), 13 states have internal predecessors, (1328), 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:22:01,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 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:22:01,187 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 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:22:01,187 INFO L186 Difference]: Start difference. First operand has 168 places, 156 transitions, 1014 flow. Second operand 13 states and 1328 transitions. [2022-07-22 21:22:01,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 264 transitions, 2016 flow [2022-07-22 21:22:01,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 264 transitions, 1948 flow, removed 31 selfloop flow, removed 1 redundant places. [2022-07-22 21:22:01,301 INFO L242 Difference]: Finished difference. Result has 183 places, 155 transitions, 977 flow [2022-07-22 21:22:01,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=977, PETRI_PLACES=183, PETRI_TRANSITIONS=155} [2022-07-22 21:22:01,302 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 61 predicate places. [2022-07-22 21:22:01,302 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 155 transitions, 977 flow [2022-07-22 21:22:01,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 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:22:01,303 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:22:01,303 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:22:01,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 21:22:01,303 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:22:01,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:22:01,304 INFO L85 PathProgramCache]: Analyzing trace with hash 307019914, now seen corresponding path program 1 times [2022-07-22 21:22:01,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:22:01,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919679077] [2022-07-22 21:22:01,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:22:01,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:22:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:22:01,421 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:22:01,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:22:01,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919679077] [2022-07-22 21:22:01,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919679077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:22:01,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:22:01,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:22:01,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845406022] [2022-07-22 21:22:01,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:22:01,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:22:01,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:22:01,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:22:01,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:22:01,425 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-07-22 21:22:01,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 155 transitions, 977 flow. Second operand has 8 states, 8 states have (on average 95.0) internal successors, (760), 8 states have internal predecessors, (760), 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:22:01,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:22:01,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-07-22 21:22:01,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:22:03,004 INFO L129 PetriNetUnfolder]: 4383/8946 cut-off events. [2022-07-22 21:22:03,004 INFO L130 PetriNetUnfolder]: For 31400/33817 co-relation queries the response was YES. [2022-07-22 21:22:03,078 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31873 conditions, 8946 events. 4383/8946 cut-off events. For 31400/33817 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 81729 event pairs, 273 based on Foata normal form. 224/8877 useless extension candidates. Maximal degree in co-relation 31827. Up to 1442 conditions per place. [2022-07-22 21:22:03,089 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 39 selfloop transitions, 22 changer transitions 89/240 dead transitions. [2022-07-22 21:22:03,089 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 240 transitions, 1823 flow [2022-07-22 21:22:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 21:22:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-22 21:22:03,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1596 transitions. [2022-07-22 21:22:03,095 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8525641025641025 [2022-07-22 21:22:03,095 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1596 transitions. [2022-07-22 21:22:03,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1596 transitions. [2022-07-22 21:22:03,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:22:03,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1596 transitions. [2022-07-22 21:22:03,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 99.75) internal successors, (1596), 16 states have internal predecessors, (1596), 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:22:03,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 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:22:03,105 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 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:22:03,105 INFO L186 Difference]: Start difference. First operand has 183 places, 155 transitions, 977 flow. Second operand 16 states and 1596 transitions. [2022-07-22 21:22:03,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 240 transitions, 1823 flow [2022-07-22 21:22:03,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 240 transitions, 1622 flow, removed 85 selfloop flow, removed 19 redundant places. [2022-07-22 21:22:03,511 INFO L242 Difference]: Finished difference. Result has 174 places, 131 transitions, 687 flow [2022-07-22 21:22:03,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=687, PETRI_PLACES=174, PETRI_TRANSITIONS=131} [2022-07-22 21:22:03,512 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 52 predicate places. [2022-07-22 21:22:03,512 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 131 transitions, 687 flow [2022-07-22 21:22:03,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.0) internal successors, (760), 8 states have internal predecessors, (760), 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:22:03,513 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:22:03,513 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:22:03,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 21:22:03,514 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:22:03,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:22:03,514 INFO L85 PathProgramCache]: Analyzing trace with hash -730302843, now seen corresponding path program 1 times [2022-07-22 21:22:03,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:22:03,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077414500] [2022-07-22 21:22:03,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:22:03,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:22:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:22:03,744 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:22:03,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:22:03,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077414500] [2022-07-22 21:22:03,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077414500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:22:03,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:22:03,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:22:03,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033163750] [2022-07-22 21:22:03,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:22:03,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:22:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:22:03,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:22:03,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:22:03,748 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 117 [2022-07-22 21:22:03,749 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 131 transitions, 687 flow. Second operand has 8 states, 8 states have (on average 94.5) internal successors, (756), 8 states have internal predecessors, (756), 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:22:03,749 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:22:03,749 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 117 [2022-07-22 21:22:03,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:22:04,281 INFO L129 PetriNetUnfolder]: 430/2790 cut-off events. [2022-07-22 21:22:04,281 INFO L130 PetriNetUnfolder]: For 5966/6189 co-relation queries the response was YES. [2022-07-22 21:22:04,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7827 conditions, 2790 events. 430/2790 cut-off events. For 5966/6189 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 33322 event pairs, 29 based on Foata normal form. 1/2623 useless extension candidates. Maximal degree in co-relation 7724. Up to 402 conditions per place. [2022-07-22 21:22:04,302 INFO L132 encePairwiseOnDemand]: 108/117 looper letters, 24 selfloop transitions, 6 changer transitions 13/153 dead transitions. [2022-07-22 21:22:04,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 153 transitions, 875 flow [2022-07-22 21:22:04,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:22:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:22:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 869 transitions. [2022-07-22 21:22:04,306 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8252611585944919 [2022-07-22 21:22:04,306 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 869 transitions. [2022-07-22 21:22:04,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 869 transitions. [2022-07-22 21:22:04,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:22:04,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 869 transitions. [2022-07-22 21:22:04,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.55555555555556) internal successors, (869), 9 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:22:04,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 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:22:04,312 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 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:22:04,312 INFO L186 Difference]: Start difference. First operand has 174 places, 131 transitions, 687 flow. Second operand 9 states and 869 transitions. [2022-07-22 21:22:04,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 153 transitions, 875 flow [2022-07-22 21:22:04,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 153 transitions, 762 flow, removed 37 selfloop flow, removed 16 redundant places. [2022-07-22 21:22:04,379 INFO L242 Difference]: Finished difference. Result has 164 places, 136 transitions, 665 flow [2022-07-22 21:22:04,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=665, PETRI_PLACES=164, PETRI_TRANSITIONS=136} [2022-07-22 21:22:04,380 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 42 predicate places. [2022-07-22 21:22:04,380 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 136 transitions, 665 flow [2022-07-22 21:22:04,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.5) internal successors, (756), 8 states have internal predecessors, (756), 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:22:04,381 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:22:04,381 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:22:04,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 21:22:04,382 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:22:04,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:22:04,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1650367669, now seen corresponding path program 2 times [2022-07-22 21:22:04,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:22:04,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806638523] [2022-07-22 21:22:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:22:04,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:22:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:22:04,758 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:22:04,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:22:04,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806638523] [2022-07-22 21:22:04,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806638523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:22:04,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:22:04,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 21:22:04,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545419924] [2022-07-22 21:22:04,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:22:04,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 21:22:04,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:22:04,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 21:22:04,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-22 21:22:04,761 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 117 [2022-07-22 21:22:04,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 136 transitions, 665 flow. Second operand has 11 states, 11 states have (on average 90.18181818181819) internal successors, (992), 11 states have internal predecessors, (992), 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:22:04,762 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:22:04,762 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 117 [2022-07-22 21:22:04,762 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:22:05,144 INFO L129 PetriNetUnfolder]: 346/2350 cut-off events. [2022-07-22 21:22:05,144 INFO L130 PetriNetUnfolder]: For 2949/3054 co-relation queries the response was YES. [2022-07-22 21:22:05,155 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6146 conditions, 2350 events. 346/2350 cut-off events. For 2949/3054 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 26907 event pairs, 9 based on Foata normal form. 20/2246 useless extension candidates. Maximal degree in co-relation 6113. Up to 288 conditions per place. [2022-07-22 21:22:05,158 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 27 selfloop transitions, 6 changer transitions 15/154 dead transitions. [2022-07-22 21:22:05,158 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 154 transitions, 873 flow [2022-07-22 21:22:05,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 21:22:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-22 21:22:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1009 transitions. [2022-07-22 21:22:05,162 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7839937839937839 [2022-07-22 21:22:05,162 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1009 transitions. [2022-07-22 21:22:05,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1009 transitions. [2022-07-22 21:22:05,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:22:05,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1009 transitions. [2022-07-22 21:22:05,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 91.72727272727273) internal successors, (1009), 11 states have internal predecessors, (1009), 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:22:05,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 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:22:05,168 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 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:22:05,168 INFO L186 Difference]: Start difference. First operand has 164 places, 136 transitions, 665 flow. Second operand 11 states and 1009 transitions. [2022-07-22 21:22:05,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 154 transitions, 873 flow [2022-07-22 21:22:05,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 154 transitions, 851 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-07-22 21:22:05,207 INFO L242 Difference]: Finished difference. Result has 169 places, 135 transitions, 677 flow [2022-07-22 21:22:05,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=677, PETRI_PLACES=169, PETRI_TRANSITIONS=135} [2022-07-22 21:22:05,208 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 47 predicate places. [2022-07-22 21:22:05,208 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 135 transitions, 677 flow [2022-07-22 21:22:05,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.18181818181819) internal successors, (992), 11 states have internal predecessors, (992), 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:22:05,209 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:22:05,209 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:22:05,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 21:22:05,210 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-22 21:22:05,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:22:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1240607429, now seen corresponding path program 3 times [2022-07-22 21:22:05,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:22:05,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874849268] [2022-07-22 21:22:05,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:22:05,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:22:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:22:05,259 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 21:22:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:22:05,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 21:22:05,351 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 21:22:05,352 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-22 21:22:05,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-22 21:22:05,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-22 21:22:05,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-22 21:22:05,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-22 21:22:05,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-22 21:22:05,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 21:22:05,356 INFO L356 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2022-07-22 21:22:05,361 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-22 21:22:05,362 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 21:22:05,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 09:22:05 BasicIcfg [2022-07-22 21:22:05,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 21:22:05,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 21:22:05,511 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 21:22:05,511 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 21:22:05,512 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:21:52" (3/4) ... [2022-07-22 21:22:05,513 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 21:22:05,617 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 21:22:05,617 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 21:22:05,618 INFO L158 Benchmark]: Toolchain (without parser) took 15124.88ms. Allocated memory was 81.8MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 41.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 605.1MB. Max. memory is 16.1GB. [2022-07-22 21:22:05,618 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 81.8MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 21:22:05,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.75ms. Allocated memory was 81.8MB in the beginning and 102.8MB in the end (delta: 21.0MB). Free memory was 41.4MB in the beginning and 63.5MB in the end (delta: -22.1MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-07-22 21:22:05,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.86ms. Allocated memory is still 102.8MB. Free memory was 63.5MB in the beginning and 61.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 21:22:05,619 INFO L158 Benchmark]: Boogie Preprocessor took 53.91ms. Allocated memory is still 102.8MB. Free memory was 61.1MB in the beginning and 59.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 21:22:05,619 INFO L158 Benchmark]: RCFGBuilder took 1018.31ms. Allocated memory is still 102.8MB. Free memory was 59.0MB in the beginning and 68.3MB in the end (delta: -9.4MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2022-07-22 21:22:05,620 INFO L158 Benchmark]: TraceAbstraction took 13389.95ms. Allocated memory was 102.8MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 67.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 572.6MB. Max. memory is 16.1GB. [2022-07-22 21:22:05,620 INFO L158 Benchmark]: Witness Printer took 106.66ms. Allocated memory is still 2.0GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-22 21:22:05,621 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 81.8MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.75ms. Allocated memory was 81.8MB in the beginning and 102.8MB in the end (delta: 21.0MB). Free memory was 41.4MB in the beginning and 63.5MB in the end (delta: -22.1MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.86ms. Allocated memory is still 102.8MB. Free memory was 63.5MB in the beginning and 61.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.91ms. Allocated memory is still 102.8MB. Free memory was 61.1MB in the beginning and 59.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1018.31ms. Allocated memory is still 102.8MB. Free memory was 59.0MB in the beginning and 68.3MB in the end (delta: -9.4MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13389.95ms. Allocated memory was 102.8MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 67.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 572.6MB. Max. memory is 16.1GB. * Witness Printer took 106.66ms. Allocated memory is still 2.0GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. 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] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L724] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L725] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L726] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L727] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L728] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L729] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L730] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L731] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L732] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L733] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L734] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L735] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L736] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L737] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L738] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L739] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t497; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t497={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t497, ((void *)0), P0, ((void *)0))=-2, t497={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t498; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t497={5:0}, t498={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t498, ((void *)0), P1, ((void *)0))=-1, t497={5:0}, t498={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t499; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t499, ((void *)0), P2, ((void *)0))=0, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L805] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L805] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L806] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L806] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L807] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L808] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L809] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L809] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L810] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L856] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 839]: 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: 843]: 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, 145 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: 13.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 676 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 676 mSDsluCounter, 578 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1084 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1437 IncrementalHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 133 mSDtfsCounter, 1437 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1014occurred in iteration=6, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 887 NumberOfCodeBlocks, 887 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 786 ConstructedInterpolants, 0 QuantifiedInterpolants, 3795 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:22:05,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE